✦ LIBER ✦

Algebraic Algorithms for Matching and Matroid Problems

✍ Scribed by Harvey, Nicholas J. A.

Book ID: 118180866
Publisher: Society for Industrial and Applied Mathematics
Year: 2009
Tongue: English
Weight: 321 KB
Volume: 39
Category: Article
ISSN: 0097-5397
DOI: 10.1137/070684008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Evolutionary Algorithms and Matroid Opti

Evolutionary Algorithms and Matroid Optimization Problems

✍ Joachim Reichel; Martin Skutella 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 470 KB

Quantum algorithms for algebraic problem

Quantum algorithms for algebraic problems

✍ Childs, Andrew M.; van Dam, Wim 📂 Article 📅 2010 🏛 The American Physical Society 🌐 English ⚖ 830 KB

Random pseudo-polynomial algorithms for

Random pseudo-polynomial algorithms for exact matroid problems

✍ P.M Camerini; G Galbiati; F Maffioli 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 852 KB

Quantum Algorithms for Matching Problems

✍ Sebastian Dörn 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 347 KB

Efficient Theoretic and Practical Algori

Efficient Theoretic and Practical Algorithms for Linear Matroid Intersection Problems

✍ Harold N. Gabow; Ying Xu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 754 KB

Efficient algorithms for the matroid intersection problem, both cardinality and weighted versions, are presented. The algorithm for weighted intersection works by scaling the weights. The cardinality algorithm is a special case, but takes advantage of greater structure. Efficiency of the algorithms

On Dynamic Algorithms for Algebraic Prob

On Dynamic Algorithms for Algebraic Problems

✍ John H. Reif; Stephen R. Tate 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 221 KB

In this paper, we examine the problem of incrementally evaluating algebraic Ž . Ž . functions. In particular, if f x , x , . . . ,