Pages that link to "Item:Q3220606"
From MaRDI portal
The following pages link to A separator theorem for graphs of bounded genus (Q3220606):
Displayed 50 items.
- A generalization of Spira's theorem and circuits with small segregators or separators (Q342721) (← links)
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces (Q603866) (← links)
- Theory and application of width bounded geometric separators (Q632801) (← links)
- Metric uniformization and spectral bounds for graphs (Q659931) (← links)
- How to catch marathon cheaters: new approximation algorithms for tracking paths (Q832889) (← links)
- On the black-box complexity of Sperner's Lemma (Q839637) (← links)
- Collective tree spanners in graphs with bounded parameters (Q848633) (← links)
- Spectral partitioning works: planar graphs and finite element meshes (Q869898) (← links)
- Sublinear separators, fragility and subexponential expansion (Q896068) (← links)
- Sublinear time width-bounded separators and their application to the protein side-chain packing problem (Q927195) (← links)
- Separator theorems and Turán-type results for planar intersection graphs (Q947779) (← links)
- Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs (Q976141) (← links)
- Enhanced algorithms for local search (Q1045925) (← links)
- Singularities, expanders and topology of maps. I: Homology versus volume in the spaces of cycles (Q1047127) (← links)
- Approximation algorithms for weighted matching (Q1102118) (← links)
- The analysis of a nested dissection algorithm (Q1103322) (← links)
- Local optimization on graphs (Q1122503) (← links)
- Edge separators for graphs of bounded genus with applications (Q1210307) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems (Q1351004) (← links)
- Separators and structure prediction in sparse orthogonal factorization (Q1361831) (← links)
- Large induced acyclic and outerplanar subgraphs of 2-outerplanar graph (Q1696548) (← links)
- On classes of graphs with strongly sublinear separators (Q1750205) (← links)
- Expanding and forwarding (Q1805464) (← links)
- ``Global'' graph problems tend to be intractable (Q1820581) (← links)
- Fragmentability of graphs (Q1850531) (← links)
- The size and depth of layered Boolean circuits (Q1944075) (← links)
- Approximation algorithms via contraction decomposition (Q1945289) (← links)
- Reconfiguring dominating sets in minor-closed graph classes (Q2053687) (← links)
- Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond (Q2121739) (← links)
- Local search is a PTAS for feedback vertex set in minor-free graphs (Q2197532) (← links)
- Hyperbolic and parabolic unimodular random maps (Q2324612) (← links)
- Layered separators in minor-closed graph classes with applications (Q2407382) (← links)
- The game of overprescribed Cops and Robbers played on graphs (Q2409518) (← links)
- On the Fiedler value of large planar graphs (Q2435468) (← links)
- Vulnerability of nearest neighbor graphs (Q2449104) (← links)
- Distributional limits of Riemannian manifolds and graphs with sublinear genus growth (Q2453453) (← links)
- The first order definability of graphs with separators via the Ehrenfeucht game (Q2570131) (← links)
- Three-coloring triangle-free graphs on surfaces. VII. A linear-time algorithm (Q2664564) (← links)
- Strongly Sublinear Separators and Polynomial Expansion (Q2808163) (← links)
- A Generalization of Spira’s Theorem and Circuits with Small Segregators or Separators (Q2891374) (← links)
- A Separator Theorem for String Graphs and its Applications (Q3058296) (← links)
- Cheeger constants of surfaces and isoperimetric inequalities (Q3182532) (← links)
- A Five-Color Theorem for Graphs on Surfaces (Q3320404) (← links)
- A Separator Theorem for Chordal Graphs (Q3344230) (← links)
- A Separator Theorem for String Graphs and Its Applications (Q3605480) (← links)
- MULTI-DIRECTIONAL WIDTH-BOUNDED GEOMETRIC SEPARATOR AND PROTEIN FOLDING (Q3607489) (← links)
- Étude de la séparation et de l'élimination sur une famille de graphes quotients déduite d'une méthode de dissections emboîtées (Q3789083) (← links)
- A Separator Theorem for Nonplanar Graphs (Q3971676) (← links)
- Polynomial-time self-reducibility: theoretical motivations and practical results<sup>∗</sup> (Q4009694) (← links)