On Some $\mathcal{NP}$ -complete SEFE Problems

DOI10.1007/978-3-319-04657-0_20zbMath1408.68106OpenAlexW2219338379WikidataQ62046561 ScholiaQ62046561MaRDI QIDQ5746258

Giordano Da Lozzo, Patrizio Angelini, Daniel Neuwirth

Publication date: 18 February 2014

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-04657-0_20

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Partial and simultaneous transitive orientations via modular decompositions ⋮ Unnamed Item ⋮ Advancements on SEFE and partitioned book embedding problems

This page was built for publication: On Some $\mathcal{NP}$ -complete SEFE Problems