Pages that link to "Item:Q963386"
From MaRDI portal
The following pages link to A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements (Q963386):
Displaying 9 items.
- Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs (Q628259) (← links)
- An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277) (← links)
- Monotonicity and expansion of global secure sets (Q1761464) (← links)
- Order consolidation for hierarchical product lines (Q2015800) (← links)
- On the properties of weighted minimum colouring games (Q2095946) (← links)
- Fast Quasi-Threshold Editing (Q3452790) (← links)
- Graph Classes and Forbidden Patterns on Three Vertices (Q5855535) (← links)
- Linear optimization over homogeneous matrix cones (Q6047504) (← links)
- Recognizing LBFS trees of bipartite graphs (Q6551704) (← links)
