A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs
From MaRDI portal
Publication:3855204
DOI10.1137/0208051zbMath0422.05029OpenAlexW2050620052MaRDI QIDQ3855204
Publication date: 1979
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0208051
Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items
Improving the results of program analysis by abstract interpretation beyond the decreasing sequence, Feedback vertex set in hypercubes, Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT, Feedback arc set in bipartite tournaments is NP-complete, Feedback vertex sets in mesh-based networks, Packing feedback arc sets in reducible flow graphs, New upper bounds on feedback vertex numbers in butterflies, Parallelism and the feedback vertex set problem, On locating minimum feedback vertex sets, The parallel complexity of approximation algorithms for the maximum acyclic subgraph problem, MIP formulations for induced graph optimization problems: a tutorial, Maximum weighted induced forests and trees: new formulations and a computational comparative review, Flow Hypergraph Reducibility, Closed-form upper bounds in static cost analysis, Flow hypergraph reducibility, Solving problems for maximal reducible flowgraphs., A constraint programming approach to cutset problems, Characterization of graphs and digraphs with small process numbers, Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem, Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis, Feedback vertex sets in star graphs, New bounds on the size of the minimum feedback vertex set in meshes and butterflies.
