Robust linear algorithms for cutsets

DOI10.1016/0196-6774(82)90020-7zbMath0493.68065OpenAlexW2018078086MaRDI QIDQ3956412

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

reducible graphminimum cutset

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)

Related Items (6)

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 ⋮ A constraint programming approach to cutset problems ⋮ Characterization of graphs and digraphs with small process numbers ⋮ Induced acyclic tournaments in random digraphs: sharp concentration, thresholds and algorithms

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