✦ LIBER ✦

An identity for bipartite matching and symmetric determinant

✍ Scribed by Kazuo Murota

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 758 KB
Volume: 222
Category: Article
ISSN: 0024-3795
DOI: 10.1016/0024-3795(93)00300-o

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An identity for symmetric bilinear forms

✍ Ky Fan 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 350 KB

An efficient identity-based protocol for

An efficient identity-based protocol for private matching

✍ Sheng Zhong; Tingting Chen 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB

Matching preclusion and conditional matc

Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions

✍ Eddie Cheng; Philip Hu; Roger Jia; László Lipták 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 113 KB

An O(n log n) algorithm for the convex b

An O(n log n) algorithm for the convex bipartite matching problem

✍ G. Gallo 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 197 KB

On-line algorithms for weighted bipartit

On-line algorithms for weighted bipartite matching and stable marriages

✍ Samir Khuller; Stephen G. Mitchell; Vijay V. Vazirani 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 884 KB

An Even Faster and More Unifying Algorit

An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings

✍ Ming-Yang Kao; Tak-Wah Lam; Wing-Kin Sung; Hing-Fung Ting 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 185 KB

This paper combines results of three conference papers: (1) A faster and unifying algorithm for comparing trees, in "Proceedings of the 11th Symposium on Combinatorial Pattern Matching, 2000," pp. 129-142; (2) Unbalanced and hierarchical bipartite matchings with applications to labeled tree comparis