Pages that link to "Item:Q1911463"
From MaRDI portal
The following pages link to On-line maintenance of triconnected components with SPQR-trees (Q1911463):
Displaying 50 items.
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271) (← links)
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph (Q450560) (← links)
- Orthogonal graph drawing with flexibility constraints (Q476441) (← links)
- A linear-time algorithm for testing outer-1-planarity (Q494794) (← links)
- Counting the number of perfect matchings in \(K_{5}\)-free graphs (Q503455) (← links)
- Efficient authenticated data structures for graph connectivity and geometric search problems (Q548654) (← links)
- Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra (Q652524) (← links)
- Orthogonal graph drawing with inflexible edges (Q679739) (← links)
- Planar bus graphs (Q724233) (← links)
- A new perspective on clustered planarity as a combinatorial embedding problem (Q897898) (← links)
- A branch-and-cut approach to the crossing number problem (Q951113) (← links)
- Non-planar core reduction of graphs (Q1011763) (← links)
- Linear-time recognition of map graphs with outerplanar witness (Q1662161) (← links)
- Characterizing and recognizing 4-map graphs (Q1741846) (← links)
- Simpler algorithms for testing two-page book embedding of partitioned graphs (Q1748996) (← links)
- Simultaneous embedding: edge orderings, relative positions, cutvertices (Q1751092) (← links)
- Incremental convex planarity testing (Q1854448) (← links)
- Unavoidable minors for graphs with large \(\ell_p\)-dimension (Q2039320) (← links)
- An SPQR-tree-like embedding representation for upward planarity (Q2206883) (← links)
- Relaxing the constraints of clustered planarity (Q2261574) (← links)
- Monotone drawings of graphs with fixed embedding (Q2346955) (← links)
- Disconnectivity and relative positions in simultaneous embeddings (Q2349740) (← links)
- Orthogonal Graph Drawing with Inflexible Edges (Q2947010) (← links)
- Simultaneous Orthogonal Planarity (Q2961544) (← links)
- Multi-interval Pairwise Compatibility Graphs (Q2988811) (← links)
- Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree (Q3000509) (← links)
- Reachability in \(K_{3,3}\)-free and \(K_5\)-free graphs is in unambiguous logspace (Q3191145) (← links)
- Connectivity Oracles for Graphs Subject to Vertex Failures (Q3387763) (← links)
- Algorithms for 1-Planar Graphs (Q5001657) (← links)
- $$\textit{\textbf{k}}$$-Planar Graphs (Q5001659) (← links)
- Simultaneous Embedding (Q5001665) (← links)
- Decremental SPQR-trees for Planar Graphs (Q5009609) (← links)
- Maximum cycle packing using SPR-trees (Q5009941) (← links)
- Computing orthogonal drawings with the minimum number of bends (Q5096950) (← links)
- Minor-Closed Graph Classes with Bounded Layered Pathwidth (Q5130575) (← links)
- Faster algorithms for shortest path and network flow based on graph decomposition (Q5240369) (← links)
- Straight-line monotone grid drawings of series–parallel graphs (Q5261041) (← links)
- Optimization and Recognition for K 5-minor Free Graphs in Linear Time (Q5458529) (← links)
- TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY (Q5493896) (← links)
- CONVEX DRAWINGS OF PLANE GRAPHS OF MINIMUM OUTER APICES (Q5493897) (← links)
- Hierarchical partial planarity (Q5915789) (← links)
- Bitonic \(st\)-orderings for upward planar graphs: splits and bends in the variable embedding scenario (Q6053469) (← links)
- Maintaining triconnected components under node expansion (Q6057331) (← links)
- (Q6065397) (← links)
- Synchronized Planarity with Applications to Constrained Planarity Problems (Q6075858) (← links)
- (Q6087210) (← links)
- Near-optimal distributed computation of small vertex cuts (Q6579850) (← links)
- Maintaining triconnected components under node expansion (Q6601461) (← links)
- Parameterized complexity of simultaneous planarity (Q6618252) (← links)
- Unit-length rectangular drawings of graphs (Q6636988) (← links)