Pages that link to "Item:Q5317569"
From MaRDI portal
The following pages link to Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs (Q5317569):
Displayed 28 items.
- Certifying algorithms (Q465678) (← links)
- Powers of cycles, powers of paths, and distance graphs (Q531605) (← links)
- Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs (Q628259) (← links)
- An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs (Q714793) (← links)
- An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277) (← links)
- Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs (Q967378) (← links)
- The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops (Q968147) (← links)
- A surprising permanence of old motivations (a not-so-rigid story) (Q1045032) (← links)
- Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049) (← links)
- Fully dynamic representations of interval graphs (Q1711837) (← links)
- Unit interval vertex deletion: fewer vertices are relevant (Q1747495) (← links)
- A Lex-BFS-based recognition algorithm for Robinsonian matrices (Q1786881) (← links)
- A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs (Q1827809) (← links)
- A certifying and dynamic algorithm for the recognition of proper circular-arc graphs (Q2232611) (← links)
- A characterization of 2-tree proper interval 3-graphs (Q2249945) (← links)
- Fully dynamic recognition of proper circular-arc graphs (Q2350902) (← links)
- Graphs and digraphs represented by intervals and circular arcs (Q2357159) (← links)
- A dichotomy for minimum cost graph homomorphisms (Q2427539) (← links)
- A simple certifying algorithm for 3-edge-connectivity (Q2689444) (← links)
- A new representation of proper interval graphs with an application to clique-width (Q2839207) (← links)
- Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory (Q2985115) (← links)
- Uniquely Restricted Matchings in Interval Graphs (Q3130447) (← links)
- BIPARTITE PERMUTATION GRAPHS ARE RECONSTRUCTIBLE (Q3166750) (← links)
- Random Generation and Enumeration of Proper Interval Graphs (Q3605496) (← links)
- Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs (Q4986807) (← links)
- Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs (Q5005187) (← links)
- On a Verification Framework for Certifying Distributed Algorithms: Distributed Checking and Consistency (Q5881540) (← links)
- Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs (Q6064836) (← links)