Solving problems for maximal reducible flowgraphs. (Q1427189): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Oswaldo Vernet / rank
Normal rank
 
Property / author
 
Property / author: Lilian Markenzon / rank
Normal rank
 
Property / author
 
Property / author: Oswaldo Vernet / rank
 
Normal rank
Property / author
 
Property / author: Lilian Markenzon / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow Graph Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of Reducible Flow Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a minimum feedback arc set in reducible flow graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimax Arc Theorem for Reducible Flow Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On digraphs with a rooted tree structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2816047 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4949849 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:21, 6 June 2024

scientific article
Language Label Description Also known as
English
Solving problems for maximal reducible flowgraphs.
scientific article

    Statements

    Solving problems for maximal reducible flowgraphs. (English)
    0 references
    14 March 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    Reducible flowgraphs
    0 references
    Hamiltonian paths
    0 references
    Isomorphism
    0 references
    Feedback arc set
    0 references
    0 references
    0 references