Pages that link to "Item:Q3220606"
From MaRDI portal
The following pages link to A separator theorem for graphs of bounded genus (Q3220606):
Displayed 33 items.
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces (Q603866) (← 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 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)
- Expanding and forwarding (Q1805464) (← links)
- ``Global'' graph problems tend to be intractable (Q1820581) (← links)
- Fragmentability of graphs (Q1850531) (← links)
- The first order definability of graphs with separators via the Ehrenfeucht game (Q2570131) (← 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)
- Shortcutting Planar Digraphs (Q4862749) (← links)
- Faster shortest-path algorithms for planar graphs (Q5906822) (← links)
- Min-max-boundary domain decomposition (Q5941438) (← links)
- General lower bounds for the minor crossing number of graphs (Q5962348) (← links)