Enumeration of all minimum feedback edge sets in a directed graph (Q3864552): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Some Studies on Connected Cover Term Matrices of Switching Functions† / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Approach for Simplifying Switching Functions by Utilizing the Cover Table Representation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some Further Studies on Determination of all the Minimal Prime Implicant Covers of Switching Functions† / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The number of paths and cycles in a digraph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Analysis of Graphs by Connectivity Considerations / rank | |||
Normal rank | |||
Latest revision as of 03:24, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Enumeration of all minimum feedback edge sets in a directed graph |
scientific article |
Statements
Enumeration of all minimum feedback edge sets in a directed graph (English)
0 references
1980
0 references
enumeration of cycles
0 references
directed graph
0 references
minimum feedback edge set
0 references
algorithm
0 references
0 references
0 references
