Pages that link to "Item:Q344849"
From MaRDI portal
The following pages link to A new LBFS-based algorithm for cocomparability graph recognition (Q344849):
Displaying 11 items.
- A tie-break model for graph search (Q896657) (← links)
- A new graph parameter to measure linearity (Q1708605) (← links)
- Recognizing graph search trees (Q2132337) (← links)
- Perfect elimination orderings for symmetric matrices (Q2174877) (← links)
- On the Power of Graph Searching for Cocomparability Graphs (Q2801333) (← links)
- A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs (Q4561265) (← links)
- The LexCycle on $\overline{P_{2}\cup P_{3}}$-free Cocomparability Graphs (Q4987262) (← links)
- The Recognition Problem of Graph Search Trees (Q4997136) (← links)
- Similarity-First Search: A New Algorithm with Application to Robinsonian Matrix Recognition (Q5351862) (← links)
- Graph Classes and Forbidden Patterns on Three Vertices (Q5855535) (← links)
- Linearizing partial search orders (Q6039439) (← links)
