An algorithm for the blocks and cutnodes of a graph

DOI10.1145/362619.362628zbMath0223.94018OpenAlexW2050911983MaRDI QIDQ5629533

Keith Paton

Publication date: 1971

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/362619.362628

Mathematics Subject Classification ID

Applications of graph theory (05C90) Applications of graph theory to circuits and networks (94C15)

Related Items

Complexity of equilibrium in competitive diffusion games on social networks, On the equivalence of constrained and unconstrained flows, Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs, Factoring with Two Large Primes, Analysis of loop methods for simulating gas networks, Enumeration of BC-subtrees of trees, On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees, A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound, On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs