Pages that link to "Item:Q2420655"
From MaRDI portal
The following pages link to Deadlock resolution in wait-for graphs by vertex/arc deletion (Q2420655):
Displaying 6 items.
- Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem (Q2028800) (← links)
- On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem (Q2078619) (← links)
- On the computational complexity of the bipartizing matching problem (Q2675722) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- Maximum weighted induced forests and trees: new formulations and a computational comparative review (Q6071056) (← links)
- Partitioning \(P_4\)-tidy graphs into a stable set and a forest (Q6166038) (← links)
