Dividing a Graph into Triconnected Components
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Non-planar core reduction of graphs
- Testing planarity of geometric automorphisms in linear time
- Structure and enumeration of two-connected graphs with prescribed three-connected components
- An algorithm for constructing star-shaped drawings of plane graphs
- Rigid tensegrity labelings of graphs
- Graph isomorphism problem
- Decomposition by clique separators
- Depth-first search is inherently sequential
- An approach to the subgraph homeomorphism problem
- Enumeration of articulation pairs of a planar graph
- A linear algorithm for embedding planar graphs using PQ-trees
- A decomposition algorithm for multi-terminal network flows
- A topological approach to dynamic graph connectivity
- Acyclic k-connected subgraphs for distributed alternate routing in communications networks
- NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems
- Counting labelled three-connected and homeomorphically irreducible two- connected graphs
- Counting unlabelled three-connected and homeomorphically irreducible two- connected graphs
- Enumerating the cycles of a digraph: a new preprocessing strategy
- Testing planar pictures for isomorphism in linear time
- A linear-time algorithm for finding an ambitus
- A new graph triconnectivity algorithm and its parallelization
- Deciding whether graph \(G\) has page number one is in NC
- An extension of the multi-path algorithm for finding Hamilton cycles
- Detecting cycles through three fixed vertices in a graph
- A linear time algorithm for computing 3-edge-connected components in a multigraph
- Parallel search algorithms for graphs and trees
- A minimum 3-connectivity augmentation of a graph
- A linear algorithm for the all-bidirectional-edges problem on planar graphs
- Graph isomorphism, general remarks
- Faster approximation algorithms for weighted triconnectivity augmentation problems
- On testing consecutive-ones property in parallel
- Advances in the theory and practice of graph drawing
- Balanced cycles and holes in bipartite graphs
- Uncovering generalized-network structure in matrices
- Representing polyhedra: Faces are better than vertices
- Independent trees in graphs
- Data structures for two-edge connectivity in planar graphs
- On the equivalence of constrained and unconstrained flows
- Planarity testing in parallel
- The input/output complexity of transitive closure
- Edge-packing planar graphs by cyclic graphs
- Projective plan and Möbius band obstructions
- Relational depth-first-search with applications
- Quadrilateral surface meshes without self-intersecting dual cycles for hexahedral mesh generation
- 4-edge-coloring graphs of maximum degree 3 in linear time
- Binary constraint satisfaction problems defined by excluded topological minors
- Linear-time recognition of map graphs with outerplanar witness
- 3-connected reduction for regular graph covers
- On the secure domination numbers of maximal outerplanar graphs
- Characterizing and recognizing 4-map graphs
- A smallest augmentation to 3-connect a graph
- A linear algorithm for the domination number of a series-parallel graph
- On the NP-hardness of edge-deletion and -contraction problems
- A note on finding the bridges of a graph
- Sewing ribbons on graphs in space
- Incremental convex planarity testing
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
- The arborescence-realization problem
- Upward planarity testing
- A decomposition algorithm for network reliability evaluation
- Drawing planar graphs using the canonical ordering
- Generalized flowers in \(k\)-connected graphs
- The structure of a decomposition of a triconnected graph
- Graphs with no \(K_{3,3}\) minor containing a fixed edge
- Efficient algorithmic learning of the structure of permutation groups by examples
- Orthogonal drawings of graphs for the automation of VLSI circuit design
- Global rigidity of direction-length frameworks
- An SPQR-tree-like embedding representation for upward planarity
- Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar graphs
- Finding densest \(k\)-connected subgraphs
- Re-embedding a 1-plane graph for a straight-line drawing in linear time
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
- Decomposition of 3-connected graphs
- A heuristic approach for dividing graphs into bi-connected components with a size constraint
- Construction sequences and certifying 3-connectivity
- A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners
- Almost exact matchings
- The source location problem with local 3-vertex-connectivity requirements
- Acyclically pushable bipartite permutation digraphs: an algorithm
- Blocks in \(k\)-connected graphs
- Linear time algorithms for graph search and connectivity determination on complement graphs.
- An improved algorithm for decomposing arc flows into multipath flows
- Jordan-like characterization of automorphism groups of planar graphs
- Globally rigid augmentation of minimally rigid graphs in \(\mathbb{R}^2\)
- Local convergence of random planar graphs
- Path-based depth-first search for strong and biconnected components
- Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time
- Some tractable win-lose games
- Finding all minimum-size separating vertex sets in a graph
- Reachability in \(K_{3,3}\)-free and \(K_5\)-free graphs is in unambiguous logspace
- Using SPQR-trees to speed up algorithms based on 2-cutset decompositions
- Network security and contagion
- On the Complexity of Matroid Isomorphism Problems
- The non-solvability by radicals of generic 3-connected planar Laman graphs
- Finding 2-edge and 2-vertex strongly connected components in quadratic time
- Linear time parameterized algorithms for subset feedback vertex set
- A plane graph representation of triconnected graphs
- Balanced group-labeled graphs
- The bottleneck 2-connected k-Steiner network problem for k 2
- Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints
This page was built for publication: Dividing a Graph into Triconnected Components
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4767335)
