On some algorithmic investigations of star partitions of graphs

DC Field	Value	Language
dc.contributor.author	Cvetković, Dragoš	en
dc.contributor.author	Rowlinson, Peter	en
dc.contributor.author	Simić, Slobodan	en
dc.date.accessioned	2020-05-01T20:12:52Z	-
dc.date.available	2020-05-01T20:12:52Z	-
dc.date.issued	1995-09-08	en
dc.identifier.issn	0166-218X	en
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/1186	-
dc.description.abstract	Star 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.publisher	Elsevier	-
dc.relation.ispartof	Discrete Applied Mathematics	en
dc.title	On some algorithmic investigations of star partitions of graphs	en
dc.type	Article	en
dc.identifier.doi	10.1016/0166-218X(94)00149-8	en
dc.identifier.scopus	2-s2.0-58149212024	en
dc.relation.firstpage	119	en
dc.relation.lastpage	130	en
dc.relation.issue	1-3	en
dc.relation.volume	62	en
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
item.openairetype	Article	-
item.cerifentitytype	Publications	-
item.fulltext	No Fulltext	-
item.grantfulltext	none	-

2

checked on Nov 24, 2024

19

checked on Nov 25, 2024

Check