✦ LIBER ✦

Two algorithms for valuated Δ-matroids

✍ Scribed by K. Murota

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 354 KB
Volume: 9
Category: Article
ISSN: 0893-9659
DOI: 10.1016/0893-9659(96)00034-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A greedy-algorithm characterization of v

A greedy-algorithm characterization of valuated Δ-matroids

✍ Andreas W.M. Dress; Walter Wenzel 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 297 KB

Two algorithms for matroids

✍ Bradley Hull 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 962 KB

Valuated matroids: a new look at the gre

Valuated matroids: a new look at the greedy algorithm

✍ Andreas W.M. Dress; Walter Wenzel 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 212 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

Maurer's Homotopy Theory and Geometric A

Maurer's Homotopy Theory and Geometric Algebra for Even Δ-Matroids

✍ Walter Wenzel 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 340 KB

The Tutte group of a matroid M is a certain abelian group which controls the representability of M. The representation theory of matroids and that of even ⌬-matroids have much in common. This paper is devoted to the extension of the concept of the Tutte group to even ⌬-matroids defined on sets of ar

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