Recognizing string graphs in NP

DOI10.1145/509907.509910zbMath1192.68376OpenAlexW2111526090MaRDI QIDQ5901045

Marcus Schaefer, Eric Sedgwick, Daniel Štefanković

Publication date: 5 August 2010

Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/509907.509910

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Crossing-constrained hierarchical drawings ⋮ Conflict-free coloring of string graphs

This page was built for publication: Recognizing string graphs in NP