Pages that link to "Item:Q3869371"
From MaRDI portal
The following pages link to A Separator Theorem for Planar Graphs (Q3869371):
Displaying 50 items.
- On the maximum order of graphs embedded in surfaces (Q273165) (← links)
- The 2-surviving rate of planar graphs without 5-cycles (Q281784) (← links)
- Network decontamination with a single agent (Q292259) (← links)
- Component-cardinality-constrained critical node problem in graphs (Q299073) (← links)
- Edge separators for quasi-binary trees (Q299105) (← links)
- Variable neighborhood search for the vertex separation problem (Q339678) (← links)
- A generalization of Spira's theorem and circuits with small segregators or separators (Q342721) (← links)
- Constant time distance queries in planar unweighted graphs with subquadratic preprocessing time (Q359743) (← links)
- Approximation algorithms for cutting a convex polyhedron out of a sphere (Q388101) (← links)
- Crossings in grid drawings (Q405129) (← links)
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane (Q412277) (← links)
- Compact and low delay routing labeling scheme for unit disk graphs (Q419502) (← links)
- Satisfiability, branch-width and Tseitin tautologies (Q430830) (← links)
- Partitioning planar graphs: a fast combinatorial approach for max-cut (Q434180) (← links)
- Approximation algorithms for maximum independent set of pseudo-disks (Q452004) (← links)
- Packing, covering and tiling in two-dimensional spaces (Q472930) (← links)
- Graph layouts via layered separators (Q473100) (← links)
- Planar graph is on fire (Q501009) (← links)
- Computing planarity in computable planar graphs (Q503647) (← links)
- Space-efficient path-reporting approximate distance oracles (Q517013) (← links)
- Ramsey numbers of cubes versus cliques (Q519968) (← links)
- Cubic polyhedral Ramanujan graphs with face size no larger than six (Q535313) (← links)
- On the number of binary characters needed to recover a phylogeny using maximum parsimony (Q545651) (← links)
- Large processors are good in VLSI chips (Q595621) (← links)
- Über Separatoren in planaren Graphen (Q599822) (← links)
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces (Q603866) (← links)
- On graph thickness, geometric thickness, and separator theorems (Q621923) (← links)
- An exact algorithm for solving the vertex separator problem (Q628743) (← links)
- Theory and application of width bounded geometric separators (Q632801) (← links)
- Sparse direct factorizations through unassembled hyper-matrices (Q649249) (← links)
- A survey of geodesic paths on 3D surfaces (Q654287) (← links)
- Metric uniformization and spectral bounds for graphs (Q659931) (← links)
- Maximum size of a planar graph with given degree and even diameter (Q661947) (← links)
- \(N\)-separators in planar graphs (Q661948) (← links)
- A nonlinear lower bound on the practical combinational complexity (Q673076) (← links)
- New graph decompositions with applications to emulations (Q675853) (← links)
- The MIN-cut and vertex separator problem (Q683339) (← links)
- Dynamic algorithms for shortest paths in planar graphs (Q685367) (← links)
- Locating facilities which interact: Some solvable cases (Q689235) (← links)
- Optimal deterministic algorithms for 2-d and 3-d shallow cuttings (Q728495) (← links)
- \(L(p,q)\)-label coloring problem with application to channel allocation (Q778676) (← links)
- Calculs de complexité relatifs à une méthode de dissection emboîtée (Q792734) (← links)
- A fast algorithm for minimum weight odd circuits and cuts in planar graphs (Q813970) (← links)
- Parameterized graph separation problems (Q820151) (← links)
- How to catch marathon cheaters: new approximation algorithms for tracking paths (Q832889) (← links)
- On the minimum corridor connection problem and other generalized geometric problems (Q833722) (← links)
- Collective tree spanners in graphs with bounded parameters (Q848633) (← links)
- A faster algorithm for computing the principal sequence of partitions of a graph (Q848839) (← links)
- On the stabbing number of a random Delaunay triangulation (Q857055) (← links)
- Spectral partitioning works: planar graphs and finite element meshes (Q869898) (← links)
