Pages that link to "Item:Q5419114"
From MaRDI portal
The following pages link to Contraction decomposition in h-minor-free graphs and algorithmic applications (Q5419114):
Displaying 17 items.
- Spanning closed walks and TSP in 3-connected planar graphs (Q462924) (← links)
- Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs (Q476424) (← links)
- An exact combinatorial algorithm for minimum graph bisection (Q747771) (← links)
- Sublinear separators, fragility and subexponential expansion (Q896068) (← links)
- Approximating graph-constrained max-cut (Q1800989) (← links)
- Polynomial bounds for centered colorings on proper minor-closed graph classes (Q1984513) (← links)
- Approximation algorithms for connected maximum cut and related problems (Q2304552) (← links)
- Structural sparsity of complex networks: bounded expansion in random models and real-world graphs (Q2316938) (← links)
- Linear kernels for outbranching problems in sparse digraphs (Q2408200) (← links)
- A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem (Q2660410) (← links)
- An LP-based approximation algorithm for the generalized traveling salesman path problem (Q2680860) (← links)
- Max-Cut Under Graph Constraints (Q3186491) (← links)
- A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface (Q3452802) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness (Q4984870) (← links)
- (Q5009572) (← links)
- Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs (Q5252660) (← links)
- (Q5743429) (← links)