On matroids and hierarchical graphs
From MaRDI portal
Publication:1178207
DOI10.1016/0020-0190(91)90232-7zbMath0739.68070WikidataQ126322022 ScholiaQ126322022MaRDI QIDQ1178207
David Fernández Baca, Mark A. Williams
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
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05B35: Combinatorial aspects of matroids and geometric lattices
Related Items
Linear-time algorithms for parametric minimum spanning tree problems on planar graphs, Decomposable multi-parameter matroid optimization problems.
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item