Recognizing planar Laman graphs
From MaRDI portal
Recommendations
Cites work
- A matroid approach to finding edge connectivity and packing arborescences
- A Separator Theorem for Planar Graphs
- A simple test on 2-vertex- and 2-edge-connectivity
- Acute triangulations of polygons
- Algorithms for graph rigidity and scene analysis
- Algorithms – ESA 2004
- All-pairs 2-reachability in \(\mathcal{O}(n^\omega\log n)\) time
- All-pairs minimum cuts in near-linear time for surface-embedded graphs
- An algorithm for two-dimensional rigidity percolation: The pebble game
- Combinatorial and geometric properties of planar Laman graphs
- Combinatorial pseudo-triangulations
- Combinatorial rigidity. Graphs and matroids in the theory of rigid frameworks
- Digraphs
- Finding strong bridges and strong articulation points in linear time
- Forests, frames, and games: Algorithms for matroid sums and applications
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 6850341 (Why is no real title available?)
- Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs
- Max flows in O(nm) time, or better
- Maximum flow in directed planar graphs with vertex capacities
- Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time
- On graphs and rigidity of plane skeletal structures
- Pebble game algorithms and sparse graphs
- Planar minimally rigid graphs and pseudo-triangulations
- Pseudo-triangulations -- a survey
- Straightening polygonal arcs and convexifying polygonal cycles
- Testing 2-vertex connectivity and computing pairs of vertex-disjoint \(s\)-\(t\) paths in digraphs
- Towards an optimal algorithm for recognizing Laman graphs
- Using expander graphs to find vertex connectivity
This page was built for publication: Recognizing planar Laman graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075827)
