Network-Based Dissolution

Bevern, van R; Bredereck, Robert; Chen, J Juan; Froese, Vincent; Niedermeier, Rolf; Woeginger, GJ Gerhard

doi:10.1007/978-3-662-44465-8_7

Cited by 3 publications

(1 citation statement)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Let us discuss a few specific application scenarios for Star Partition with respect to important subclasses of perfect graphs. First, Star Partition on grid graphs naturally occurs in political redistricting problems [3]. We show that Star Partition remains NP-complete on subcubic grid graphs.…”

Section: Star Partitionmentioning

confidence: 93%

Star Partitions of Perfect Graphs

Bevern

Bredereck

Bulteau

et al. 2014

Automata, Languages, and Programming

Self Cite

View full text Add to dashboard Cite

Bevern, van, R.; Bredereck, R.; Bulteau, L.; Chen, J.; Froese, V.; Niedermeier, R.; Woeginger, G.Published: 01/01/2014 Document VersionPublisher's PDF, also known as Version of Record (includes final page, issue and volume numbers) Please check the document version of this publication:• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website.• The final author version and the galley proof are versions of the publication after peer review.• The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rightsCopyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights.• Users may download and print one copy of any publication from the public portal for the purpose of private study or research.• You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal ? Take down policyIf you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim. Abstract The partition of graphs into nice subgraphs is a central algorithmic problem with strong ties to matching theory. We study the partitioning of undirected graphs into stars, a problem known to be NP-complete even for the case of stars on three vertices. We perform a thorough computational complexity study of the problem on subclasses of perfect graphs and identify several polynomial-time solvable and NP-hard cases, for example, on interval graphs, grid graphs, and bipartite permutation graphs.

show abstract

Section: Star Partitionmentioning

confidence: 93%