On finding fundamental cut sets

DOI10.1016/J.IPL.2009.11.014zbMATH Open1197.05152OpenAlexW2056160971MaRDI QIDQ990139FDOQ990139

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

Recommendations

• Minimum cuts in near-linear time
• scientific article; zbMATH DE number 742961
• scientific article; zbMATH DE number 1256719
• Minimum Cuts of Simple Graphs in Almost Always Linear Time
• A near-linear time algorithm for constructing a cactus representation of minimum cuts

zbMATH Keywords

algorithmsgraph algorithmsfundamental cut sets

Mathematics Subject Classification ID

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

Cites Work

• Network flows. Theory, algorithms, and applications.
• Title not available (Why is that?)
• Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithms for three-dimensional dominance searching in linear space.
• Dominance made simple
• Fully-dynamic min-cut
• FAST ALGORITHMS FOR 3-D DOMINANCE REPORTING AND COUNTING
• Parallel algorithm for finding the most vital edge in weighted graphs

Cited In (2)

• A linear algorithm for the cutting center of a tree
• A NOTE ON THE 1-CUTSET PROPERTY

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

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