An algorithm for the blocks and cutnodes of a graph

DOI10.1145/362619.362628MaRDI QIDQ5629533zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(11)

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

This page was built for publication: An algorithm for the blocks and cutnodes of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5629533)