Enumeration of all minimum feedback edge sets in a directed graph

DOI10.1080/00207728008967010zbMath0428.05034OpenAlexW2131741883MaRDI QIDQ3864552

Pradip K. Srimani

Publication date: 1980

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207728008967010

zbMATH Keywords

algorithmdirected graphminimum feedback edge setenumeration of cycles

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items

On enumerating all minimal solutions of feedback problems

Cites Work

• The number of paths and cycles in a digraph
• Analysis of Graphs by Connectivity Considerations
• Some Studies on Connected Cover Term Matrices of Switching Functions†
• Some Further Studies on Determination of all the Minimal Prime Implicant Covers of Switching Functions†
• An Approach for Simplifying Switching Functions by Utilizing the Cover Table Representation