NP-completeness of some tree-clustering problems

Falk Schreiber, Konstantinos Skodinis

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

3 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationGraph Drawing - 6th International Symposium, GD 1998, Proceedings
EditorsSue H. Whitesides
PublisherSpringer
Pages288-301
Number of pages14
ISBN (Print)3540654739, 9783540654735
DOIs
Publication statusPublished - 1999
Externally publishedYes
EventGraph Drawing 1998 - Montreal, Canada
Duration: 13 Aug 199815 Aug 1998
Conference number: 6th
http://www.graphdrawing.org/symposia.html
https://link.springer.com/book/10.1007/3-540-37623-2 (Proceedings)

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume1547
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceGraph Drawing 1998
Abbreviated titleGD 1998
CountryCanada
CityMontreal
Period13/08/9815/08/98
Internet address

Cite this