Pages that link to "Item:Q967378"
From MaRDI portal
The following pages link to Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs (Q967378):
Displaying 14 items.
- On the isomorphism problem for Helly circular-arc graphs (Q259081) (← links)
- Forbidden induced subgraphs of normal Helly circular-arc graphs: characterization and detection (Q344830) (← links)
- Solving the canonical representation and star system problems for proper circular-arc graphs in logspace (Q350727) (← links)
- Circular-arc hypergraphs: rigidity via connectedness (Q516817) (← links)
- An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277) (← links)
- Normal Helly circular-arc graphs and its subclasses (Q1949109) (← links)
- On the lengths of tree-like and dag-like cutting plane refutations of Horn constraint systems. Horn constraint systems and cutting plane refutations (Q2095546) (← links)
- Essential obstacles to Helly circular-arc graphs (Q2166233) (← links)
- A certifying and dynamic algorithm for the recognition of proper circular-arc graphs (Q2232611) (← links)
- Fully dynamic recognition of proper circular-arc graphs (Q2350902) (← links)
- Analyzing read-once cutting plane proofs in Horn systems (Q2673307) (← links)
- Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory (Q2985115) (← links)
- Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter II: algorithms (Q2985116) (← links)
- On a Verification Framework for Certifying Distributed Algorithms: Distributed Checking and Consistency (Q5881540) (← links)