Extending partial representations of circle graphs in near-linear time

DOI10.1007/S00453-024-01216-5MaRDI QIDQ6582371zbMATH OpenFDO

Authors Guido Brückner, Ignaz Rutter, Peter Stumpf

Publication date 2 August 2024

Published in Algorithmica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

recognitiongeometric intersection graphscircle graphssimultaneous representation

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites work

• scientific article; zbMATH DE number 177843 (Why is no real title available?)
• $O(M\cdot N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs
• Circle graph isomorphism in almost linear time
• Circle graphs and monadic second-order logic
• Decomposition of Directed Graphs
• Extending partial representations of circle graphs
• Extending partial representations of function graphs and permutation graphs
• Extending partial representations of trapezoid graphs
• Extending simple drawings
• ON EXTENDING A PARTIAL STRAIGHT-LINE DRAWING
• Partial and simultaneous transitive orientations via modular decompositions
• Practical and efficient circle graph recognition
• Practical and efficient split decomposition via graph-labelled trees
• Recognition of Circle Graphs
• Reducing prime graphs and recognizing circle graphs
• Testing Planarity of Partially Embedded Graphs
• Transitiv orientierbare Graphen

This page was built for publication: Extending partial representations of circle graphs in near-linear time

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