The Computational Complexity of the ChordLink Model

DOI10.7155/JGAA.00643MaRDI QIDQ6181950zbMATH OpenFDO

Authors Philipp Kindermann, Alexander Wolff

Publication date 20 December 2023

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

Copyright license Creative Commons Attribution 4.0 International

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)

Recommendations

• ChordLink: a new hybrid visualization model
• Graph graphics: Theory and practice
• Complexity of the cluster deletion problem on subclasses of chordal graphs

Cites work

• Beyond Clustered Planar Graphs
• Intersection-link representations of graphs
• Some optimal inapproximability results

Cited in

(1)

• ChordLink: a new hybrid visualization model

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)