The following pages link to Computing an st-numbering (Q1231771):
Displayed 50 items.
- Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs (Q385485) (← links)
- A generalized greedy routing algorithm for 2-connected graphs (Q606989) (← links)
- An efficient distributed algorithm for centering a spanning tree of a biconnected graph (Q671408) (← links)
- Closed rectangle-of-influence drawings for irreducible triangulations (Q709065) (← links)
- Visibility representations of four-connected plane graphs with near optimal heights (Q833713) (← links)
- L-visibility drawings of IC-planar graphs (Q903189) (← links)
- A branch-and-cut approach to the crossing number problem (Q951113) (← links)
- Algorithms for computing a parameterized \(st\)-orientation (Q959815) (← links)
- Convex drawings of hierarchical planar graphs and clustered planar graphs (Q988690) (← links)
- Optimal \(st\)-orientations for plane triangulations (Q1029266) (← links)
- A linear algorithm for embedding planar graphs using PQ-trees (Q1083864) (← links)
- A unified approach to visibility representations of planar graphs (Q1085167) (← links)
- Rectilinear planar layouts and bipolar orientations of planar graphs (Q1085168) (← links)
- Parallel ear decomposition search (EDS) and st-numbering in graphs (Q1095666) (← links)
- Graph graphics: Theory and practice (Q1103411) (← links)
- The multi-tree approach to reliability in distributed networks (Q1109560) (← links)
- An efficient parallel algorithm for planarity (Q1114415) (← links)
- Rubber bands, convex embeddings and graph connectivity (Q1121282) (← links)
- Algorithms for plane representations of acyclic digraphs (Q1124349) (← links)
- st-ordering the vertices of biconnected graphs (Q1167194) (← links)
- On the thickness of graphs of given degree (Q1174334) (← links)
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms (Q1242450) (← links)
- Finding the closed partition of a planar graph (Q1322561) (← links)
- A linear algorithm for centering a spanning tree of a biconnected graph (Q1332759) (← links)
- At most single-bend embeddings of cubic graphs (Q1335404) (← links)
- Planarity testing in parallel (Q1342859) (← links)
- A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid (Q1382254) (← links)
- Algorithms for area-efficient orthogonal drawing (Q1384191) (← links)
- A better heuristic for orthogonal graph drawings (Q1384200) (← links)
- The minimum size of graphs satisfying cut conditions (Q1701098) (← links)
- \(\mathsf{T}\)-shape visibility representations of 1-planar graphs (Q1702255) (← links)
- Simple computation of \textit{st}-edge- and \textit{st}-numberings from ear decompositions (Q1730030) (← links)
- Edge-orders (Q1741850) (← links)
- Balanced vertex-orderings of graphs (Q1775059) (← links)
- Bipolar orientations revisited (Q1842650) (← links)
- The complexity of planarity testing (Q1887150) (← links)
- A left-first search algorithm for planar graphs (Q1892422) (← links)
- Drawing graphs on rectangular grids (Q1902892) (← links)
- Drawing planar graphs using the canonical ordering (Q1920418) (← links)
- On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm (Q1920431) (← links)
- Enumerating the edge-colourings and total colourings of a regular graph (Q1956248) (← links)
- A self-stabilizing algorithm for constructing a minimal reachable directed acyclic graph with two senders and two targets (Q2034405) (← links)
- A diameter-revealing proof of the Bondy-Lovász lemma (Q2059880) (← links)
- Almost envy-free allocations with connected bundles (Q2078044) (← links)
- Combinatorial approximation algorithms for the maximum bounded connected bipartition problem (Q2111532) (← links)
- Approximation algorithms for the maximum bounded connected bipartition problem (Q2151359) (← links)
- Variants of the segment number of a graph (Q2206875) (← links)
- NP-completeness of st-orientations for plane graphs (Q2268858) (← links)
- Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits (Q2403234) (← links)
- A note on rectilinear and polar visibility graphs (Q2486070) (← links)