On matroids and hierarchical graphs

DOI10.1016/0020-0190(91)90232-7zbMath0739.68070OpenAlexW2058122596WikidataQ126322022 ScholiaQ126322022MaRDI QIDQ1178207

Mark A. Williams, David Fernández Baca

Publication date: 26 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90232-7

zbMATH Keywords

greedy algorithmmatroidal families

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (3)

Linear-time algorithms for parametric minimum spanning tree problems on planar graphs ⋮ Decomposable multi-parameter matroid optimization problems. ⋮ Linear-time algorithms for parametric minimum spanning tree problems on planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• The complexity of combinatorial problems with succinct input representation
• A linear-time algorithm for finding a minimum spanning pseudoforest
• Infinite subgraphs as matroid circuits
• Succinct representations of graphs
• Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs
• Efficient Solution of Connectivity Problems on Hierarchically Defined Graphs

This page was built for publication: On matroids and hierarchical graphs