Pages that link to "Item:Q3605497"
From MaRDI portal
The following pages link to A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs (Q3605497):
Displaying 12 items.
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- A simple algorithm to find Hamiltonian cycles in proper interval graphs (Q989586) (← links)
- A linear time recognition algorithm for proper interval graphs (Q1014413) (← links)
- The clique-separator graph for chordal graphs (Q1026133) (← links)
- Fully dynamic representations of interval graphs (Q1711837) (← links)
- A fully dynamic graph algorithm for recognizing interval graphs (Q1957648) (← 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)
- Recognizing \(d\)-interval graphs and \(d\)-track interval graphs (Q2375953) (← links)
- (Q4250178) (← links)
- (Q4590888) (← links)
- Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs (Q5317569) (← links)