DC FieldValueLanguage
dc.contributor.authorCvetković, Dragošen
dc.contributor.authorRowlinson, Peteren
dc.contributor.authorSimić, Slobodanen
dc.date.accessioned2020-05-01T20:12:52Z-
dc.date.available2020-05-01T20:12:52Z-
dc.date.issued1995-09-08en
dc.identifier.issn0166-218Xen
dc.description.abstractStar partitions of graphs were introduced in a recent paper by the same authors in order to extend spectral methods in algebraic graph theory. Here it is shown that the corresponding partitioning problem is polynomial. Two algorithms are investigated: the first is based on the maximum matching problem for graphs, and the second invokes an algorithm for matroid intersection.en
dc.publisherElsevier-
dc.relation.ispartofDiscrete Applied Mathematicsen
dc.titleOn some algorithmic investigations of star partitions of graphsen
dc.typeArticleen
dc.identifier.doi10.1016/0166-218X(94)00149-8en
dc.identifier.scopus2-s2.0-58149212024en
dc.relation.firstpage119en
dc.relation.lastpage130en
dc.relation.issue1-3en
dc.relation.volume62en
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
Show simple item record

SCOPUSTM   
Citations

2
checked on Nov 27, 2022

Page view(s)

9
checked on Nov 28, 2022

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.