Pages that link to "Item:Q5266611"
From MaRDI portal
The following pages link to Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth (Q5266611):
Displaying 6 items.
- Computing directed pathwidth in \(O(1.89^n)\) time (Q300464) (← links)
- Finding small-width connected path decompositions in polynomial time (Q2328867) (← links)
- A Polynomial Time Algorithm for Bounded Directed Pathwidth (Q3104788) (← links)
- Computing Directed Pathwidth in O(1.89 n ) Time (Q4899252) (← links)
- (Q5091271) (← links)
- Linear ordering based MIP formulations for the vertex separation or pathwidth problem (Q5915912) (← links)