Computing an st-numbering
From MaRDI portal
Publication:1231771
DOI10.1016/0304-3975(76)90086-4zbMath0341.68029WikidataQ61772236 ScholiaQ61772236MaRDI QIDQ1231771
Robert Endre Tarjan, Shimon Even
Publication date: 1976
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(76)90086-4
Related Items
The two basic linear time Planarity algorithms: Are they the same?, An efficient distributed algorithm for centering a spanning tree of a biconnected graph, A branch-and-cut approach to the crossing number problem, Algorithms for computing a parameterized \(st\)-orientation, A linear algorithm for embedding planar graphs using PQ-trees, A unified approach to visibility representations of planar graphs, Rectilinear planar layouts and bipolar orientations of planar graphs, Parallel ear decomposition search (EDS) and st-numbering in graphs, Graph graphics: Theory and practice, The multi-tree approach to reliability in distributed networks, An efficient parallel algorithm for planarity, Rubber bands, convex embeddings and graph connectivity, Algorithms for plane representations of acyclic digraphs, st-ordering the vertices of biconnected graphs, On the thickness of graphs of given degree, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, Finding the closed partition of a planar graph, A linear algorithm for centering a spanning tree of a biconnected graph, At most single-bend embeddings of cubic graphs, Planarity testing in parallel, A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid, Algorithms for area-efficient orthogonal drawing, A better heuristic for orthogonal graph drawings, Balanced vertex-orderings of graphs, Bipolar orientations revisited, The complexity of planarity testing, A left-first search algorithm for planar graphs, Drawing graphs on rectangular grids, Drawing planar graphs using the canonical ordering, On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm, A note on rectilinear and polar visibility graphs, Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights, The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing, A direct linear-time planarity test for unflippable modules
Cites Work
