st-ordering the vertices of biconnected graphs

DOI10.1007/BF02253293zbMath0491.05057OpenAlexW152936037WikidataQ61772235 ScholiaQ61772235MaRDI QIDQ1167194

Jürgen Ebert

Publication date: 1983

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02253293

zbMATH Keywords

vertex-numberingplanarity tests of graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99) Connectivity (05C40)

Related Items (11)

Rectilinear planar layouts and bipolar orientations of planar graphs ⋮ A left-first search algorithm for planar graphs ⋮ Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits ⋮ A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid ⋮ A generalized greedy routing algorithm for 2-connected graphs ⋮ A self-stabilizing algorithm for the st-order problem ⋮ Simple computation of \textit{st}-edge- and \textit{st}-numberings from ear decompositions ⋮ Algorithms for computing a parameterized \(st\)-orientation ⋮ Balanced vertex-orderings of graphs ⋮ A self-stabilizing algorithm for constructing a minimal reachable directed acyclic graph with two senders and two targets ⋮ A diameter-revealing proof of the Bondy-Lovász lemma

Cites Work

• Computing an st-numbering
• Finding Dominators in Directed Graphs
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: st-ordering the vertices of biconnected graphs