Pages that link to "Item:Q692902"
From MaRDI portal
The following pages link to A note on exact algorithms for vertex ordering problems on graphs (Q692902):
Displaying 15 items.
- Exact algorithms for intervalizing coloured graphs (Q255264) (← links)
- Computing directed pathwidth in \(O(1.89^n)\) time (Q300464) (← links)
- Treewidth and pathwidth parameterized by the vertex cover number (Q344839) (← links)
- On exact algorithms for the permutation CSP (Q392031) (← links)
- Computing the pathwidth of directed graphs with small vertex cover (Q477674) (← links)
- Computing tree-depth faster than \(2^n\) (Q493242) (← links)
- Minimal NMR distance information for rigidity of protein graphs (Q1728101) (← links)
- On distance-preserving elimination orderings in graphs: complexity and algorithms (Q1752455) (← links)
- Finding small-width connected path decompositions in polynomial time (Q2328867) (← links)
- Rank-width: algorithmic and structural results (Q2403788) (← links)
- Improved Parameterized Algorithms for above Average Constraint Satisfaction (Q2891342) (← links)
- (Q5091271) (← links)
- Positive-Instance Driven Dynamic Programming for Treewidth. (Q5111757) (← links)
- Characterizations and directed path-width of sequence digraphs (Q6038712) (← links)
- Strong SDP based bounds on the cutwidth of a graph (Q6065655) (← links)
