On finding fundamental cut sets

DOI10.1016/j.ipl.2009.11.014zbMath1197.05152OpenAlexW2056160971MaRDI QIDQ990139

Sanjeev Saxena

Publication date: 2 September 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.11.014

zbMATH Keywords

algorithmsgraph algorithmsfundamental cut sets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fully-dynamic min-cut
• Dominance made simple
• Parallel algorithm for finding the most vital edge in weighted graphs
• Algorithms for three-dimensional dominance searching in linear space.
• FAST ALGORITHMS FOR 3-D DOMINANCE REPORTING AND COUNTING
• Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values

This page was built for publication: On finding fundamental cut sets