Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems

DOI10.1137/0218008zbMath0669.68048OpenAlexW1997214284MaRDI QIDQ3823151

Mandayam A. Srinivas, Greg N. Frederickson

Publication date: 1989

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://docs.lib.purdue.edu/cstech/601

zbMATH Keywords

matroidefficient algorithmspanning trees

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Combinatorial aspects of matroids and geometric lattices (05B35) Algorithms in computer science (68W99)

Related Items (5)

Matroid optimization with generalized constraints ⋮ Maintaining minimum spanning trees in dynamic graphs ⋮ A bound for the symmetric travelling salesman problem through matroid formulation ⋮ The \(k\)-path tree matroid and its applications to survivable network design ⋮ How to allocate review tasks for robust ranking

This page was built for publication: Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems