Pages that link to "Item:Q2801333"
From MaRDI portal
The following pages link to On the power of graph searching for cocomparability graphs (Q2801333):
Displaying 13 items.
- A new LBFS-based algorithm for cocomparability graph recognition (Q344849) (← links)
- A tie-break model for graph search (Q896657) (← links)
- A new graph parameter to measure linearity (Q1708605) (← links)
- Maximum induced matching algorithms via vertex ordering characterizations (Q1986960) (← links)
- Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number (Q2940988) (← links)
- (Q4387703) (← 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)
- Characterization and a 2D Visualization of B$$_{0}$$-VPG Cocomparability Graphs (Q5014117) (← links)
- Maximum Induced Matching Algorithms via Vertex Ordering Characterizations (Q5136263) (← links)
- Graph Classes and Forbidden Patterns on Three Vertices (Q5855535) (← links)
- (Q5874479) (← links)
- Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications (Q6493757) (← links)
