On locating minimum feedback vertex sets

DOI10.1016/0022-0000(88)90009-8zbMath0661.68065OpenAlexW2014119074MaRDI QIDQ1113681

Ching-Chy Wang, Errol L. Lloyd, Mary Lou Soffa

Publication date: 1988

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(88)90009-8

zbMATH Keywords

directed graphspolynomial timereducible flow graphscyclically reducible graphsminimum feedback vertex sets

Mathematics Subject Classification ID

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

Related Items

Feedback vertex set in hypercubes, Feedback vertex sets in mesh-based networks, New upper bounds on feedback vertex numbers in butterflies, Almost exact minimum feedback vertex set in meshes and butterflies, Solving the feedback vertex set problem on undirected graphs, A constraint programming approach to cutset problems, Algorithms for finding maximum transitive subtournaments, The integrity of a cubic graph

Cites Work

• Unnamed Item
• Feedback vertex sets and cyclically reducible graphs
• A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs
• An Approach to a Unified Theory of Automata
• Flow Graph Reducibility