Pages that link to "Item:Q4842112"
From MaRDI portal
The following pages link to $O(M\cdot N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs (Q4842112):
Displayed 14 items.
- Practical and efficient split decomposition via graph-labelled trees (Q472485) (← links)
- On orthogonal ray graphs (Q602682) (← links)
- A simpler linear-time recognition of circular-arc graphs (Q644807) (← links)
- Two remarks on circular arc graphs (Q675889) (← links)
- An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277) (← links)
- On the structure of certain intersection graphs (Q845675) (← links)
- On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results (Q1044994) (← links)
- Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049) (← links)
- A selected tour of the theory of identification matrices (Q1575436) (← links)
- Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs (Q1765527) (← links)
- Graph isomorphism and identification matrices: Sequential algorithms (Q1970201) (← links)
- Solving the path cover problem on circular-arc graphs by using an approximation algorithm (Q2581561) (← links)
- A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs (Q3512472) (← links)
- From a Circular-Arc Model to a Proper Circular-Arc Model (Q5302066) (← links)
