Forests, frames, and games: Algorithms for matroid sums and applications

1992/06/01 by Harold N. Gabow, Herbert Westermann, Herbert H. Westermann · 3 citations
Computer Science · Engineering · Mathematics · #Advanced Materials and Mechanics #Algorithm #Cardinality (data modeling) #Combinatorics #Computational Geometry and Mesh Generation #Computer science #Discrete mathematics #Disjoint sets #Graphic matroid #Mathematics #Matroid #Matroid partitioning #Spanning tree #Structural Analysis and Optimization #Submodular set function #Theoretical computer science #Weighted matroid

paper · doi:10.1007/bf01758774

crossref issued 1992/06/01 · crossref published 1992/06/01 · crossref published-print 1992/06/01 · openalex publication_date 1992/06/01 · crossref created 2005/06/15 · crossref deposited 2019/05/08 · openalex created_date 2025/10/10 · crossref indexed 2026/01/18 · openalex updated_date 2026/07/23

Citations

• Matroid Theory and its Applications in Electric Network Theory and in Statics
• A data structure for dynamic trees
• A linear-time algorithm for a special case of disjoint set union
• Arboricity and Subgraph Listing Algorithms
• Combinatorial optimization: networks and matroids
• On graphs and rigidity of plane skeletal structures
• An n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs

Cited by

• Efficient computation of implicit representations of sparse graphs
• Arboricity [wikipedia]
• Edge coloring [wikipedia]