Pages that link to "Item:Q1210706"
From MaRDI portal
The following pages link to Planar graphs: Theory and algorithms (Q1210706):
Displaying 50 items.
- A strengthened analysis of an algorithm for dominating set in planar graphs (Q415281) (← links)
- Faster computation of the Robinson-Foulds distance between phylogenetic networks (Q454925) (← links)
- Maximum flow in directed planar graphs with vertex capacities (Q634675) (← links)
- Does contraction preserve triangular meshes? (Q676930) (← links)
- Small grid drawings of planar graphs with balanced partition (Q695321) (← links)
- Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies (Q849634) (← links)
- Hamiltonicity and colorings of arrangement graphs (Q860408) (← links)
- Classes of cycle bases (Q868389) (← links)
- Drawing \(c\)-planar biconnected clustered graphs (Q885287) (← links)
- Bipartite graphs, upward drawings, and planarity (Q918730) (← links)
- Upward drawings of triconnected digraphs. (Q960528) (← links)
- The theorem on planar graphs (Q1071005) (← links)
- An algorithm for the characterization of the nonplanarity of a maximal graphical partition (Q1095148) (← links)
- Heuristic for rapidly four-coloring large planar graphs (Q1180542) (← links)
- On the approximation of protein threading (Q1274599) (← links)
- Convex representations of maps on the torus and other flat surfaces (Q1314444) (← links)
- Flow in planar graphs with vertex capacities (Q1317474) (← links)
- At most single-bend embeddings of cubic graphs (Q1335404) (← links)
- Planar graphs, Hamilton cycles and extreme independence number (Q1339131) (← links)
- On planar perfectly contractile graphs (Q1359374) (← links)
- A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid (Q1382254) (← links)
- Maximum \((s,t)\)-flows in planar networks in \(\mathcal O(|V| \log |V|)\) time (Q1384532) (← links)
- Simple planar graph partition into three forests (Q1392570) (← links)
- Rectangular grid drawings of plane graphs (Q1392851) (← links)
- Orthogonal drawings based on the stratification of planar graphs (Q1422412) (← links)
- Divider-based algorithms for hierarchical tree partitioning. (Q1427182) (← links)
- Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots (Q1585319) (← links)
- Uniqueness of equilibria in atomic splittable polymatroid congestion games (Q1631639) (← links)
- On almost-planar graphs (Q1753021) (← links)
- A modular approach to Sprouts (Q1765239) (← links)
- List total colorings of series-parallel graphs (Q1775015) (← links)
- Cliques and extended triangles. A necessary condition for planar clique graphs (Q1827850) (← links)
- Incremental convex planarity testing (Q1854448) (← links)
- Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems. (Q1854505) (← links)
- A left-first search algorithm for planar graphs (Q1892422) (← links)
- Triangle graphs (Q1893541) (← links)
- Parallel approximation schemes for problems on planar graphs (Q1924999) (← links)
- Concurrence and three-tangle of the graph (Q1993873) (← links)
- Orthogonal planarity testing of bounded treewidth graphs (Q2071827) (← links)
- Building a maximal independent set for the vertex-coloring problem on planar graphs (Q2133444) (← links)
- A heuristic for the coloring of planar graphs (Q2133446) (← links)
- The growth and form of tunnelling networks in ants (Q2202378) (← links)
- Re-embedding a 1-plane graph for a straight-line drawing in linear time (Q2235768) (← links)
- Monotone drawings of graphs with fixed embedding (Q2346955) (← links)
- The searching over separators strategy to solve some NP-hard problems in subexponential time (Q2366228) (← links)
- Each maximal planar graph with exactly two separating triangles is Hamiltonian (Q2383540) (← links)
- On RAC drawings of 1-planar graphs (Q2402260) (← links)
- A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem (Q2489303) (← links)
- The entire coloring of series-parallel graphs (Q2577645) (← links)
- Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey (Q2695475) (← links)
