Homotopy base of acyclic graphs - a combinatorial analysis of commutative diagrams by means of preordered matroid (Q1097893)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Homotopy base of acyclic graphs - a combinatorial analysis of commutative diagrams by means of preordered matroid |
scientific article; zbMATH DE number 4035854
| 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; zbMATH DE number 4035854 |
Statements
Homotopy base of acyclic graphs - a combinatorial analysis of commutative diagrams by means of preordered matroid (English)
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
parallel paths
0 references
acyclic graph
0 references
homotopy base
0 references
preordered matroid
0 references
greedy algorithm
0 references
