Skip to main content
Conference Proceedings

Recognition of polygon-circle graphs and graphs of interval filaments is NP-complete

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2007) 4769 LNCS 238-247
DOI: 10.1007/978-3-540-74839-7_23
17Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Polygon-circle graphs (PC-graphs) are defined as intersection graphs of polygons inscribed into a circle, graphs of interval filaments (IFA-graphs) are intersection graphs of curves with both endpoints on prescribed line (filament), filaments above two disjoint intervals must not intersect each other. Recognition of these classes has been a long outstanding open problem. We prove that it is NP-complete to recognize both classes. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Pergel, M. (2007). Recognition of polygon-circle graphs and graphs of interval filaments is NP-complete. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4769 LNCS, pp. 238–247). Springer Verlag. https://doi.org/10.1007/978-3-540-74839-7_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free