scientific article; zbMATH DE number 7375988
From MaRDI portal
Publication:5002738
DOI10.4230/LIPIcs.ICALP.2018.61zbMath1499.68270arXiv1602.07013MaRDI QIDQ5002738
Paweł Gawrychowski, Adam Karczmarz
Publication date: 28 July 2021
Full work available at URL: https://arxiv.org/abs/1602.07013
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) Data structures (68P05)
Related Items
Tiling with Squares and Packing Dominos in Polynomial Time, Geometric multicut: shortest fences for separating groups of objects in the plane, Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs., Unnamed Item, Min-Cost Flow in Unit-Capacity Planar Graphs, Single-source shortest paths and strong connectivity in dynamic planar graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding small simple cycle separators for 2-connected planar graphs
- Geometric applications of a matrix-searching algorithm
- Preserving order in a forest in less than logarithmic time and linear space
- Faster shortest paths in dense distance graphs, with applications
- Planar graphs, negative weight edges, shortest paths, and near linear time
- Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time
- All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs
- Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search
- Shortest Paths in Planar Graphs with Real Lengths in O(nlog2 n/loglogn) Time
- Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs
- Min st -Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time
- Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices, and Their Applications
- Fibonacci heaps and their uses in improved network optimization algorithms
- Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
- Improved algorithms for min cut and max flow in undirected planar graphs
- Structured recursive separator decompositions for planar graphs in linear time
