The following pages link to Faster Computation of Path-Width (Q2819521):
Displaying 9 items.
- A faster parameterized algorithm for pseudoforest deletion (Q1693129) (← links)
- Cutwidth: obstructions and algorithmic aspects (Q1725643) (← links)
- FPT algorithms to enumerate and count acyclic and totally cyclic orientations (Q2132402) (← links)
- Finding small-width connected path decompositions in polynomial time (Q2328867) (← links)
- Typical sequences revisited -- computing width parameters of graphs (Q2701067) (← links)
- Computing Pathwidth Faster Than 2 n (Q3656873) (← links)
- A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth (Q5062107) (← links)
- (Q5874536) (← links)
- Linear ordering based MIP formulations for the vertex separation or pathwidth problem (Q5915912) (← links)