Output-sensitive reporting of disjoint paths (extended abstract)

DOI10.1007/3-540-61332-3_141zbMath1529.68204OpenAlexW1488253238MaRDI QIDQ6142894

Giuseppe Di Battista, Luca Vismara, Roberto Tamassia

Publication date: 29 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61332-3_141

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The multi-tree approach to reliability in distributed networks
• Planar graphs and poset dimension
• Maintaining bridge-connected and biconnected components on-line
• A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
• Computing an st-numbering
• Bipolar orientations revisited
• Improved data structures for fully dynamic biconnectivity
• The connectivity carcass of a vertex subset in a graph and its incremental maintenance
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• Network Flow and Testing Graph Connectivity
• The Order Dimension of Convex Polytopes
• Reinventing the wheel
• Separator based sparsification for dynamic planar graph algorithms

This page was built for publication: Output-sensitive reporting of disjoint paths (extended abstract)