Partitioning Perfect Graphs into Stars

Journal of Graph Theory, Volume 85, Issue 2, 2017, Pages 297-335.

Cited by: 9|Views40
EI

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 same-size 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 su...More

Code:

Data:

Your rating :
0

 

Tags
Comments