✦ LIBER ✦

Ranks and Representations for Spectral Graph Bisection

✍ Scribed by Martin, Jacob G.; Canfield, E. Rodney

Book ID: 118191058
Publisher: Society for Industrial and Applied Mathematics
Year: 2009
Tongue: English
Weight: 293 KB
Volume: 31
Category: Article
ISSN: 1064-8275
DOI: 10.1137/070710640

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Spectral bisection of graphs and connect

Spectral bisection of graphs and connectedness

✍ Urschel, John C.; Zikatanov, Ludmil T. 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 300 KB

Orthogonal representations, minimum rank

Orthogonal representations, minimum rank, and graph complements

✍ Leslie Hogben 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 134 KB

Semi-supervised low-rank representation

Semi-supervised low-rank representation graph for pattern recognition

✍ Yang, Shuyuan; Wang, Xiuxiu; Wang, Min; Han, Yue; Jiao, Licheng 📂 Article 📅 2013 🏛 The Institution of Engineering and Technology 🌐 English ⚖ 309 KB

On the Optimality of the Median Cut Spec

On the Optimality of the Median Cut Spectral Bisection Graph Partitioning Method

✍ Chan, Tony F.; Ciarlet, P.; Szeto, W. K. 📂 Article 📅 1997 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 211 KB

On the Graph Bisection Cut Polytope

✍ Armbruster, Michael; Helmberg, Christoph; Fügenschuh, Marzena; Martin, Alexander 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 326 KB

On defining affinity graph for spectral

On defining affinity graph for spectral clustering through ranking on manifolds

✍ Tian Xia; Juan Cao; Yong-dong Zhang; Jin-tao Li 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 638 KB