The following pages link to (Q4035766):
Displaying 14 items.
- A new LBFS-based algorithm for cocomparability graph recognition (Q344849) (← links)
- A linear-time algorithm for proper interval graph recognition (Q672268) (← links)
- On end-vertices of lexicographic breadth first searches (Q968161) (← links)
- A new graph parameter to measure linearity (Q1708605) (← links)
- Fully dynamic representations of interval graphs (Q1711837) (← 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)
- Weighted independent perfect domination on cocomparability graphs (Q1917231) (← links)
- Graph searches and their end vertices (Q2165035) (← links)
- The LexCycle on $\overline{P_{2}\cup P_{3}}$-free Cocomparability Graphs (Q4987262) (← links)
- Similarity-First Search: A New Algorithm with Application to Robinsonian Matrix Recognition (Q5351862) (← links)
- (Q5874479) (← links)
- Graphs with at most two moplexes (Q6595515) (← links)
- Semi-proper interval graphs (Q6648246) (← links)
