Pages that link to "Item:Q1639288"
From MaRDI portal
The following pages link to And/or-convexity: a graph convexity based on processes and deadlock models (Q1639288):
Displayed 5 items.
- On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem (Q2078619) (← links)
- A general framework for path convexities (Q2156285) (← links)
- \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers (Q2172420) (← links)
- Computing the best-case energy complexity of satisfying assignments in monotone circuits (Q2674710) (← links)
- Formulas in connection with parameters related to convexity of paths on three vertices: caterpillars and unit interval graphs (Q4990134) (← links)