Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > NC ALGORITHMS:
Reports tagged with NC Algorithms:
TR12-066 | 22nd April 2012
Jinyu Huang

Parallel Complexity for Matroid Intersection and Matroid Parity Problems

Revisions: 1

Let two linear matroids have the same rank in matroid intersection.
A maximum linear matroid intersection (maximum linear matroid parity
set) is called a basic matroid intersection (basic matroid parity
set), if its size is the rank of the matroid. We present that
enumerating all basic matroid intersections (basic matroid ... more >>>




ISSN 1433-8092 | Imprint