On matroids and hierarchical graphs

DOI10.1007/3-540-52846-6_101zbMath1502.68225OpenAlexW1504334518MaRDI QIDQ5056114

Mark A. Williams, David Fernández Baca

Publication date: 9 December 2022

Published in: SWAT 90 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-52846-6_101

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Combinatorial aspects of matroids and geometric lattices (05B35)

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
• On subgraphs as matroid cells
• Succinct representations of graphs
• Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs
• Efficient Solution of Connectivity Problems on Hierarchically Defined Graphs
• BICIRCULAR MATROIDS
• A note on succinct representations of graphs
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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