Homotopy base of acyclic graphs - a combinatorial analysis of commutative diagrams by means of preordered matroid (Q1097893): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4773298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5523467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometries on partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst case analysis of greedy type algorithms for independence systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network flow, transportation and scheduling. Theory and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a homotopy base for directed paths in an acyclic graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5638112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111952 / rank
 
Normal rank

Latest revision as of 15:45, 18 June 2024

scientific article
Language Label Description Also known as
English
Homotopy base of acyclic graphs - a combinatorial analysis of commutative diagrams by means of preordered matroid
scientific article

    Statements

    Homotopy base of acyclic graphs - a combinatorial analysis of commutative diagrams by means of preordered matroid (English)
    0 references
    0 references
    1987
    0 references
    The system of parallel paths in a given acyclic graph provide the basis for investigation in this paper. The concept of homotopy base and preordered matroid is introduced and a greedy algorithm for finding a homotopy base is derived.
    0 references
    0 references
    parallel paths
    0 references
    acyclic graph
    0 references
    homotopy base
    0 references
    preordered matroid
    0 references
    greedy algorithm
    0 references