Non-crossing shortest paths lengths in planar graphs in linear time
From MaRDI portal
Publication:6057315
DOI10.1007/978-3-031-30448-4_6arXiv2011.04047OpenAlexW4366957966MaRDI QIDQ6057315
Lorenzo Balzotti, Paolo Giulio Franciosa
Publication date: 4 October 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.04047
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- A framework for solving VLSI graph layout problems
- A linear-time algorithm for a special case of disjoint set union
- Preserving order in a forest in less than logarithmic time and linear space
- Non-crossing shortest paths in undirected unweighted planar graphs in linear time
- Thick non-crossing paths and minimum-cost flows in polygonal domains
- New lower bound techniques for VLSI
- Minimums-tCut of a Planar Undirected Network in $O(n\log ^2 (n))$ Time
- k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON
- Max flow vitality in general and st‐planar graphs
- Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs
- Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time
- Faster shortest-path algorithms for planar graphs
- How vulnerable is an undirected planar graph with respect to max flow
