Robust linear algorithms for cutsets
From MaRDI portal
Publication:3956412
DOI10.1016/0196-6774(82)90020-7zbMath0493.68065MaRDI QIDQ3956412
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
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
68W99: Algorithms in computer science
Related Items
A polyhedral approach to the feedback vertex set problem, 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