Pages that link to "Item:Q4767335"
From MaRDI portal
The following pages link to Dividing a Graph into Triconnected Components (Q4767335):
Displaying 50 items.
- An approach to the subgraph homeomorphism problem (Q1062457) (← links)
- Enumeration of articulation pairs of a planar graph (Q1071024) (← links)
- A linear algorithm for embedding planar graphs using PQ-trees (Q1083864) (← links)
- A decomposition algorithm for multi-terminal network flows (Q1085042) (← links)
- A topological approach to dynamic graph connectivity (Q1108030) (← links)
- Acyclic k-connected subgraphs for distributed alternate routing in communications networks (Q1115406) (← links)
- NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems (Q1120597) (← links)
- Counting labelled three-connected and homeomorphically irreducible two- connected graphs (Q1147157) (← links)
- Counting unlabelled three-connected and homeomorphically irreducible two- connected graphs (Q1147158) (← links)
- Enumerating the cycles of a digraph: a new preprocessing strategy (Q1172396) (← links)
- Testing planar pictures for isomorphism in linear time (Q1175964) (← links)
- A linear-time algorithm for finding an ambitus (Q1186786) (← links)
- A new graph triconnectivity algorithm and its parallelization (Q1193533) (← links)
- Deciding whether graph \(G\) has page number one is in NC (Q1195855) (← links)
- An extension of the multi-path algorithm for finding Hamilton cycles (Q1197026) (← links)
- Detecting cycles through three fixed vertices in a graph (Q1198018) (← links)
- A linear time algorithm for computing 3-edge-connected components in a multigraph (Q1199755) (← links)
- Parallel search algorithms for graphs and trees (Q1204800) (← links)
- A minimum 3-connectivity augmentation of a graph (Q1208926) (← links)
- A linear algorithm for the all-bidirectional-edges problem on planar graphs (Q1209732) (← links)
- Graph isomorphism, general remarks (Q1255944) (← links)
- Faster approximation algorithms for weighted triconnectivity augmentation problems (Q1267191) (← links)
- On testing consecutive-ones property in parallel (Q1281757) (← links)
- Advances in the theory and practice of graph drawing (Q1285778) (← links)
- Balanced cycles and holes in bipartite graphs (Q1297428) (← links)
- Uncovering generalized-network structure in matrices (Q1308737) (← links)
- Representing polyhedra: Faces are better than vertices (Q1314534) (← links)
- Independent trees in graphs (Q1323489) (← links)
- Data structures for two-edge connectivity in planar graphs (Q1331953) (← links)
- On the equivalence of constrained and unconstrained flows (Q1339398) (← links)
- Planarity testing in parallel (Q1342859) (← links)
- The input/output complexity of transitive closure (Q1360681) (← links)
- Edge-packing planar graphs by cyclic graphs (Q1382263) (← links)
- Projective plan and Möbius band obstructions (Q1385984) (← links)
- Relational depth-first-search with applications (Q1602553) (← links)
- Quadrilateral surface meshes without self-intersecting dual cycles for hexahedral mesh generation (Q1602943) (← links)
- 4-edge-coloring graphs of maximum degree 3 in linear time (Q1603501) (← links)
- Binary constraint satisfaction problems defined by excluded topological minors (Q1633806) (← links)
- Linear-time recognition of map graphs with outerplanar witness (Q1662161) (← links)
- 3-connected reduction for regular graph covers (Q1663806) (← links)
- On the secure domination numbers of maximal outerplanar graphs (Q1693127) (← links)
- Characterizing and recognizing 4-map graphs (Q1741846) (← links)
- A smallest augmentation to 3-connect a graph (Q1813979) (← links)
- A linear algorithm for the domination number of a series-parallel graph (Q1837213) (← links)
- On the NP-hardness of edge-deletion and -contraction problems (Q1838829) (← links)
- A note on finding the bridges of a graph (Q1844076) (← links)
- Sewing ribbons on graphs in space (Q1850620) (← links)
- Incremental convex planarity testing (Q1854448) (← links)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
- The arborescence-realization problem (Q1893159) (← links)
