Largest planar matching in random bipartite graphs

DOI10.1002/RSA.10048zbMath1016.05065OpenAlexW2170483796MaRDI QIDQ4803315

Martin Loebl, Marcos A. Kiwi

Publication date: 2 April 2003

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.10048

zbMATH Keywords

longest common subsequencelongest increasing subsequencerandom bipartite graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Expected length of the longest common subsequence for large alphabets

Cites Work

• Unnamed Item
• Longest Increasing and Decreasing Subsequences

This page was built for publication: Largest planar matching in random bipartite graphs