Homotopy base of acyclic graphs - a combinatorial analysis of commutative diagrams by means of preordered matroid

DOI10.1016/0166-218X(87)90009-6zbMath0636.05018OpenAlexW2041937846MaRDI QIDQ1097893

Kazuo Murota

Publication date: 1987

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(87)90009-6

zbMATH Keywords

greedy algorithmacyclic graphhomotopy baseparallel pathspreordered matroid

Mathematics Subject Classification ID

Paths and cycles (05C38) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (1)

Finding a homotopy base for directed paths in an acyclic graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding a homotopy base for directed paths in an acyclic graph
• Geometries on partially ordered sets
• Network flow, transportation and scheduling. Theory and algorithms
• Worst case analysis of greedy type algorithms for independence systems

This page was built for publication: Homotopy base of acyclic graphs - a combinatorial analysis of commutative diagrams by means of preordered matroid