scientific article; zbMATH DE number 1947397
From MaRDI portal
Publication:4411363
zbMath1019.68803MaRDI QIDQ4411363
Publication date: 8 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2461/24610247.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (15)
Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice ⋮ Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits ⋮ Planar Confluent Orthogonal Drawings of 4-Modal Digraphs ⋮ Planar confluent orthogonal drawings of 4-modal digraphs ⋮ \(st\)-orientations with few transitive edges ⋮ $st$-Orientations with Few Transitive Edges ⋮ Simultaneous Orthogonal Planarity ⋮ An \(O(n+m)\) certifying triconnnectivity algorithm for Hamiltonian graphs ⋮ Certifying algorithms ⋮ 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 ⋮ Space efficient linear time algorithms for BFS, DFS and applications
This page was built for publication:
