Enumeration of all minimum feedback edge sets in a directed graph (Q3864552): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/00207728008967010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2131741883 / rank
 
Normal rank
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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references