Independent sets versus perfect matchings

DOI10.1016/0304-3975(94)00289-UzbMath0873.68082MaRDI QIDQ673116

Shang-Hua Teng

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

matchingsindependent sets

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Cites Work

• The complexity of computing the permanent
• Matching is as easy as matrix inversion
• A Las Vegas RNC algorithm for maximum matching
• A taxonomy of problems with fast parallel algorithms
• Parallel Prefix Computation
• Unnamed Item

This page was built for publication: Independent sets versus perfect matchings