✦ LIBER ✦

Maximum gradient embeddings and monotone clustering

✍ Scribed by Manor Mendel; Assaf Naor

Book ID: 106167740
Publisher: Springer-Verlag
Year: 2010
Tongue: English
Weight: 446 KB
Volume: 30
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s00493-010-2302-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximum Genus of Strong Embeddings

✍ Er-ling Wei; Yan-pei Liu; Han Ren 📂 Article 📅 2003 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 190 KB

Exponentially many maximum genus embeddi

Exponentially many maximum genus embeddings and genus embeddings for complete graphs

✍ Han Ren; Yun Bai 📂 Article 📅 2008 🏛 SP Science China Press 🌐 English ⚖ 277 KB

Monotone gradient dynamics and Mather's

Monotone gradient dynamics and Mather's shadowing

✍ Slijepcevic, S 📂 Article 📅 1999 🏛 Institute of Physics 🌐 English ⚖ 257 KB

Re-embeddings of Maximum 1-Planar Graphs

✍ Suzuki, Yusuke 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 300 KB

Monotone linkage clustering and quasi-co

Monotone linkage clustering and quasi-concave set functions

✍ Y. Kempner; B. Mirkin; I. Muchnik 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 385 KB

## Communicated by A. Dress Abstract--Greedily seriating objects one by one is implicitly employed in many heuristic clustering procedures which can be described in terms of a linkage function measuring entity-to-set dissimilarities. A well-known clustering technique, single linkage clustering, ca

Lower Bound of the Number of Maximum Gen

Lower Bound of the Number of Maximum Genus Embeddings and Genus Embeddings ofK12s+7

✍ Ren Han; Gao Yanbo 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 244 KB