Pages that link to "Item:Q3906439"
From MaRDI portal
The following pages link to Applications of a Planar Separator Theorem (Q3906439):
Displaying 50 items.
- Exact algorithms for intervalizing coloured graphs (Q255264) (← links)
- Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems (Q287003) (← links)
- Fast balanced partitioning is hard even on grids and trees (Q388790) (← links)
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane (Q412277) (← links)
- New constructions of SSPDs and their applications (Q419372) (← links)
- Linkless and flat embeddings in 3-space (Q420569) (← links)
- Satisfiability, branch-width and Tseitin tautologies (Q430830) (← links)
- Partitioning planar graphs: a fast combinatorial approach for max-cut (Q434180) (← links)
- On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
- Minimum vertex cover in rectangle graphs (Q551504) (← links)
- Linear space data structures for two types of range search (Q578916) (← links)
- Small grid embeddings of 3-polytopes (Q629826) (← links)
- Theory and application of width bounded geometric separators (Q632801) (← links)
- On the induced matching problem (Q657915) (← links)
- A nonlinear lower bound on the practical combinational complexity (Q673076) (← links)
- The MIN-cut and vertex separator problem (Q683339) (← links)
- Locating facilities which interact: Some solvable cases (Q689235) (← links)
- Unimodular hyperbolic triangulations: circle packing and random walk (Q730189) (← links)
- Approximating the partition function of planar two-state spin systems (Q743131) (← links)
- An exact combinatorial algorithm for minimum graph bisection (Q747771) (← links)
- A bounded-error quantum polynomial-time algorithm for two graph bisection problems (Q747789) (← links)
- Planar acyclic computation (Q751805) (← links)
- Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy (Q760204) (← links)
- An efficient parallel algorithm for computing a large independent set in a planar graph (Q808288) (← links)
- Parameterized graph separation problems (Q820151) (← links)
- Better distance labeling for unweighted planar graphs (Q832885) (← links)
- How to catch marathon cheaters: new approximation algorithms for tracking paths (Q832889) (← links)
- Hard constraint satisfaction problems have hard gaps at location 1 (Q837178) (← links)
- \(\ell ^2_2\) spreading metrics for vertex ordering problems (Q848848) (← links)
- On the stabbing number of a random Delaunay triangulation (Q857055) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Sublinear separators, fragility and subexponential expansion (Q896068) (← links)
- Multilayer grid embeddings for VLSI (Q916362) (← links)
- On cleaving a planar graph (Q917567) (← links)
- A distributed shortest path algorithm for a planar network (Q918205) (← links)
- A lower bound on the area of permutation layouts (Q922710) (← links)
- Formula dissection: A parallel algorithm for constraint satisfaction (Q931750) (← links)
- Linearity of grid minors in treewidth with applications through bidimensionality (Q949776) (← links)
- Every minor-closed property of sparse graphs is testable (Q962147) (← links)
- Approximability of clausal constraints (Q970111) (← links)
- Approximating nearest neighbor among triangles in convex position (Q975498) (← links)
- Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces (Q1007250) (← links)
- The power of geometric duality (Q1082821) (← links)
- Polynomial-average-time satisfiability problems (Q1095678) (← links)
- Nonserial dynamic programming formulations of satisfiability (Q1099093) (← links)
- Approximation algorithms for weighted matching (Q1102118) (← links)
- An application of the planar separator theorem to counting problems (Q1108031) (← links)
- A parallel graph partitioning algorithm for a message-passing multiprocessor (Q1111029) (← links)
- Simulating two pushdown stores by one tape in \(O(n^{1.5}\,\sqrt{\log \,n})\) time (Q1113670) (← links)
- Lower bounds for synchronous circuits and planar circuits (Q1114661) (← links)
