The Computational Complexity of the ChordLink Model

DOI10.7155/JGAA.00643MaRDI QIDQ6181950FDOQ6181950

Philipp Kindermann, Author name not available (Why is that?), Alexander Wolff

Publication date: 20 December 2023

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Some optimal inapproximability results
• Beyond Clustered Planar Graphs
• Intersection-Link Representations of Graphs

This page was built for publication: The Computational Complexity of the ChordLink Model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6181950)