Complexity of finding embeddings in a k-tree
SIAM Journal on Algebraic and Discrete Methods
NP-completeness of graph decomposition problems
Journal of Complexity
Graph drawing by force-directed placement
Software—Practice & Experience
Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
SIAM Journal on Computing
Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
How to Draw a Planar Clustered Graph
COCOON '95 Proceedings of the First Annual International Conference on Computing and Combinatorics
Graph Clustering 1: Circles of Cliques
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Graph Clustering Using Multiway Ratio Cut
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Multilevel Visualization of Clustered Graphs
GD '96 Proceedings of the Symposium on Graph Drawing
GD '96 Proceedings of the Symposium on Graph Drawing
Splitting a graph into disjoint induced paths or cycles
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
Splitting a graph into disjoint induced paths or cycles
Discrete Applied Mathematics
| Hi-index | 0.01 |
A graph is a tree of paths (cycles), if its vertex set can be partitioned into clusters, such that each cluster induces a simple path (cycle), and the clusters form a tree. Our main result states that the problem whether or not a given graph is a tree of paths (cycles) is NP-complete. Moreover, if the length of the paths (cycles) is bounded by a constant, the problem is in P.