Decomposable multi-parameter matroid optimization problems
David Fernández-Baca
Theoretical Computer Science
297(1–3):183–198, Mar 2003
Cites:
Using sparsification for parametric minimum spanning tree problems
Separator based sparsification I: planarity testing and minimum spanning trees
Sparsification — A technique for speeding up dynamic graph algorithms
[
D. Eppstein publications
] [
Citation database
] [
Documents
]
Fano
Experimental Web Server,
D. Eppstein
,
School of Information & Computer Science
,
UC Irvine
