Pages that link to "Item:Q1957648"
From MaRDI portal
The following pages link to A fully dynamic graph algorithm for recognizing interval graphs (Q1957648):
Displaying 8 items.
- Backup 2-center on interval graphs (Q442280) (← links)
- Fully dynamic representations of interval graphs (Q1711837) (← 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)
- Fully dynamic recognition of proper circular-arc graphs (Q2350902) (← links)
- Recognizing \(d\)-interval graphs and \(d\)-track interval graphs (Q2375953) (← links)
- Computing the clique-separator graph for an interval graph in linear time (Q2628270) (← links)
- (Q4250178) (← links)