✦ LIBER ✦

Optimal random matchings, tours, and spanning trees in hierarchically separated trees

✍ Scribed by Csaba, Béla; Plick, Thomas A.; Shokoufandeh, Ali

Book ID: 120366903
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 989 KB
Volume: 500
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.05.021

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Matchings and spanning trees in Boolean

Matchings and spanning trees in Boolean weighted graphs

✍ Kenneth A Berman 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 384 KB

Maximum matchings in bipartite graphs vi

Maximum matchings in bipartite graphs via strong spanning trees

✍ M. L. Balinski; J. Gonzalez 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 692 KB

On the number of spanning trees and Eule

On the number of spanning trees and Eulerian tours in iterated line digraphs

✍ Zhang Huaxiao; Zhang Fuji; Huang Qiongxiang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 448 KB

Rotationally optimal spanning and Steine

Rotationally optimal spanning and Steiner trees in uniform orientation metrics

✍ Marcus Brazil; Benny K. Nielsen; Pawel Winter; Martin Zachariasen 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 174 KB

Diameter of random spanning trees in a g

Diameter of random spanning trees in a given graph

✍ Fan Chung; Paul Horn; L. Lu 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 1 views

## Abstract Motivated by the observation that the sparse tree‐like subgraphs in a small world graph have large diameter, we analyze random spanning trees in a given host graph. We show that the diameter of a random spanning tree of a given host graph __G__ is between and with high probability., w

On the numbers of spanning trees and Eul

On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs

✍ Xueliang Li; Fuji Zhang 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 756 KB