A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs
From MaRDI portal
Cited in
(22)- Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis
- Feedback arc set in bipartite tournaments is NP-complete
- A constraint programming approach to cutset problems
- Closed-form upper bounds in static cost analysis
- Improving the results of program analysis by abstract interpretation beyond the decreasing sequence
- New upper bounds on feedback vertex numbers in butterflies
- Parallelism and the feedback vertex set problem
- Feedback vertex set in hypercubes
- New bounds on the size of the minimum feedback vertex set in meshes and butterflies.
- Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem
- Flow Hypergraph Reducibility
- MIP formulations for induced graph optimization problems: a tutorial
- Feedback vertex sets in star graphs
- On locating minimum feedback vertex sets
- Packing feedback arc sets in reducible flow graphs
- Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT
- Maximum weighted induced forests and trees: new formulations and a computational comparative review
- Feedback vertex sets in mesh-based networks
- The parallel complexity of approximation algorithms for the maximum acyclic subgraph problem
- Flow hypergraph reducibility
- Characterization of graphs and digraphs with small process numbers
- Solving problems for maximal reducible flowgraphs.
This page was built for publication: A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3855204)
