A linear time implementation of SPQR-trees
From MaRDI portal
Recommendations
Cited in
(94)- Non-planar core reduction of graphs
- Testing planarity of geometric automorphisms in linear time
- An algorithm for constructing star-shaped drawings of plane graphs
- Linear-time recognition of map graphs with outerplanar witness
- 3-connected reduction for regular graph covers
- On maximum common subgraph problems in series-parallel graphs
- Recognizing optimal 1-planar graphs in linear time
- \(\mathsf{T}\)-shape visibility representations of 1-planar graphs
- Bend-minimum orthogonal drawings in quadratic time
- A linear-time algorithm for testing full outer-2-planarity
- Simpler algorithms for testing two-page book embedding of partitioned graphs
- Using SPQR-trees to speed up recognition algorithms based on 2-cutsets
- On-line maintenance of triconnected components with SPQR-trees
- Planar straight-line realizations of 2-trees with prescribed edge lengths
- An SPQR-tree-like embedding representation for upward planarity
- Relaxing the constraints of clustered planarity
- Monotone drawings of graphs with fixed embedding
- Disconnectivity and relative positions in simultaneous embeddings
- On the recognition of fan-planar and maximal outer-fan-planar graphs
- Universal slope sets for 1-bend planar drawings
- A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners
- An O(n+m) certifying triconnnectivity algorithm for Hamiltonian graphs
- Jordan-like characterization of automorphism groups of planar graphs
- Drawing partial 2-trees with few slopes
- Mondshein sequences (a.k.a. (2,1)-orders)
- Outer 1-planar graphs
- Planar embeddings with small and uniform faces
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected graph or a tree
- Using SPQR-trees to speed up algorithms based on 2-cutset decompositions
- On-line graph algorithms with SPQR-trees
- The SPQR-tree data structure in graph drawing
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
- Certifying algorithms
- A Möbius-invariant power diagram and its applications to soap bubbles and planar Lombardi drawing
- Orthogonal graph drawing with flexibility constraints
- A linear-time algorithm for testing outer-1-planarity
- \(k\)-planar graphs
- Fan-planar graphs
- Decremental SPQR-trees for Planar Graphs
- Maximum cycle packing using SPR-trees
- Triconnected planar graphs of maximum degree five are subhamiltonian
- Upward planar drawings with two slopes
- Approximation Algorithms for Facial Cycles in Planar Embeddings
- Finding Tutte paths in linear time
- Minor-Closed Graph Classes with Bounded Layered Pathwidth
- VERTEX DECOMPOSITION TO CALCULATE THE NETWORK PROBABILISTIC CONNECTIVITY
- Faster algorithms for shortest path and network flow based on graph decomposition
- On the Hardness and Approximability of Planar Biconnectivity Augmentation
- Optimization and Recognition for K 5-minor Free Graphs in Linear Time
- Tractable minor-free generalization of planar zero-field Ising models
- Percolation thresholds for robust network connectivity
- Advances in the planarization method: effective multiple edge insertions
- Graph isomorphism restricted by lists
- Bitonic \(st\)-orderings for upward planar graphs: splits and bends in the variable embedding scenario
- Upward book embeddability of \(st\)-graphs: complexity and algorithms
- Inserting Multiple Edges into a Planar Graph
- Synchronized Planarity with Applications to Constrained Planarity Problems
- scientific article; zbMATH DE number 7765396 (Why is no real title available?)
- Rectilinear planarity of partial 2-trees
- Testing upward planarity of partial 2-trees
- The Rique-number of graphs
- Some insights on dynamic maintenance of Gomory-Hu tree in cactus graphs and general graphs
- Separator-based data reduction for signed graph balancing
- Rectilinear Planarity of Partial 2-Trees
- On 2-strong connectivity orientations of mixed graphs and related problems
- A linear delay algorithm for enumeration of 2-edge/vertex-connected induced subgraphs
- Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra
- Testing the planar straight-line realizability of 2-trees with prescribed edge lengths
- Enumerating combinatorial resultant trees
- Maintaining triconnected components under node expansion
- A more accurate view of the flat wall theorem
- On upward-planar L-drawings of graphs
- On the parameterized complexity of bend-minimum orthogonal planarity
- On the parameterized complexity of bend-minimum orthogonal planarity
- Unit-length rectangular drawings of graphs
- Orthogonal graph drawing with inflexible edges
- Rectilinear-upward planarity testing of digraphs
- Recognition complexity of subgraphs of \({\mathbf{k}}\)-connected planar cubic graphs
- On computing vertex connectivity of 1-planar graphs
- The st-planar edge completion problem is fixed-parameter tractable
- Shortest beer path queries based on graph decomposition
- Rectilinear-upward planarity testing of digraphs
- Efficient recognition of subgraphs of planar cubic bridgeless graphs
- A linear delay algorithm in SD set system and its application to subgraph enumeration
- Constrained planarity in practice -- engineering the synchronized planarity algorithm
- Planar bus graphs
- The price of upwardness
- Streaming algorithms for network design
- Edge-coloured graphs with only monochromatic perfect matchings and their connection to quantum physics
- An optimal 3-fault-tolerant connectivity oracle
- A dichotomy for 1-planarity with restricted crossing types parameterized by treewidth
- Connectivity of workflow nets: The foundations of stepwise verification
- Classes of cycle bases
- A branch-and-cut approach to the crossing number problem
This page was built for publication: A linear time implementation of SPQR-trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4472293)
