Pages that link to "Item:Q3656873"
From MaRDI portal
The following pages link to Computing Pathwidth Faster Than 2 n (Q3656873):
Displaying 11 items.
- Computing directed pathwidth in \(O(1.89^n)\) time (Q300464) (← links)
- On cutwidth parameterized by vertex cover (Q476444) (← links)
- Computing the pathwidth of directed graphs with small vertex cover (Q477674) (← links)
- Computing tree-depth faster than \(2^n\) (Q493242) (← links)
- A note on exact algorithms for vertex ordering problems on graphs (Q692902) (← links)
- Notes on tree- and path-chromatic number (Q2058953) (← links)
- Finding small-width connected path decompositions in polynomial time (Q2328867) (← links)
- On Cutwidth Parameterized by Vertex Cover (Q2891354) (← links)
- (Q5091271) (← links)
- Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth (Q5266611) (← links)
- Linear ordering based MIP formulations for the vertex separation or pathwidth problem (Q5915912) (← links)
