Pages that link to "Item:Q644807"
From MaRDI portal
The following pages link to A simpler linear-time recognition of circular-arc graphs (Q644807):
Displaying 14 items.
- Forbidden induced subgraphs of normal Helly circular-arc graphs: characterization and detection (Q344830) (← links)
- Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs (Q967378) (← links)
- Linear-time recognition of circular-arc graphs (Q1424251) (← links)
- On the recognition of digital circles in linear time (Q1803274) (← links)
- Normal Helly circular-arc graphs and its subclasses (Q1949109) (← links)
- Recognizing generalized transmission graphs of line segments and circular sectors (Q2294728) (← links)
- Fully dynamic recognition of proper circular-arc graphs (Q2350902) (← links)
- Induced disjoint paths in circular-arc graphs in linear time (Q2629233) (← links)
- Direct and Certifying Recognition of Normal Helly Circular-Arc Graphs in Linear Time (Q3188829) (← links)
- Recognition of Circle Graphs (Q4285912) (← links)
- A linear time algorithm to recognize circular permutation graphs (Q4887747) (← links)
- Polynomial time recognition of unit circular-arc graphs (Q5468870) (← links)
- A Simpler Linear-Time Recognition of Circular-Arc Graphs (Q5757898) (← links)
- Reconfiguring shortest paths in graphs (Q6623589) (← links)