Robust linear algorithms for cutsets

DOI10.1016/0196-6774(82)90020-7MaRDI QIDQ3956412zbMATH OpenOpenAlexFDO

Authors Barry K. Rosen

Publication date 1982

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(82)90020-7

zbMATH Keywords

minimum cutsetreducible graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99)

Cited in

(6)

• Characterization of graphs and digraphs with small process numbers
• A constraint programming approach to cutset problems
• Induced acyclic tournaments in random digraphs: sharp concentration, thresholds and algorithms
• Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT
• The complexity of minimum cut and maximum flow problems in an acyclic network
• A polyhedral approach to the feedback vertex set problem

This page was built for publication: Robust linear algorithms for cutsets

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