scientific article; zbMATH DE number 7525516
From MaRDI portal
Publication:5075827
DOI10.4230/LIPIcs.ESA.2019.79MaRDI QIDQ5075827
Lena Schlipf, André Schulz, Jonathan Rollin
Publication date: 11 May 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding strong bridges and strong articulation points in linear time
- Straight line triangle representations
- Maximum flow in directed planar graphs with vertex capacities
- Combinatorial pseudo-triangulations
- Forests, frames, and games: Algorithms for matroid sums and applications
- An algorithm for two-dimensional rigidity percolation: The pebble game
- Straightening polygonal arcs and convexifying polygonal cycles
- Planar minimally rigid graphs and pseudo-triangulations
- A matroid approach to finding edge connectivity and packing arborescences
- A simple test on 2-vertex- and 2-edge-connectivity
- Pebble game algorithms and sparse graphs
- On graphs and rigidity of plane skeletal structures
- All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs
- Towards an optimal algorithm for recognizing Laman graphs
- Using expander graphs to find vertex connectivity
- Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs
- A Separator Theorem for Planar Graphs
- All-Pairs 2-Reachability in O(n^w log n) Time
- Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
- Algorithms – ESA 2004
- Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs
- Max flows in O(nm) time, or better
- Digraphs
- Combinatorial and Geometric Properties of Planar Laman Graphs
- Acute triangulations of polygons
- Algorithms - ESA 2003
This page was built for publication:
