Enumeration of all minimum feedback edge sets in a directed graph

DOI10.1080/00207728008967010MaRDI QIDQ3864552zbMATH OpenOpenAlexFDO

Authors Pradip K. Srimani

Publication date 1980

Published in International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)

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

zbMATH Keywords

algorithmdirected graphenumeration of cyclesminimum feedback edge set

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(1)

• On enumerating all minimal solutions of feedback problems

This page was built for publication: Enumeration of all minimum feedback edge sets in a directed graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3864552)