Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs Philip N. Klein1 , Claire Mathieu2,3 , and Hang Zhou3 1 Brown University, United States

First Page		Document Content
Date: 2015-03-16 13:08:36 NP-complete problems Cluster analysis Correlation clustering Graph Minor Planar graph Dominating set Independent set Matroid theory Graph theory Mathematics Theoretical computer science		Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs Philip N. Klein1 , Claire Mathieu2,3 , and Hang Zhou3 1 Brown University, United States Add to Reading List Source URL: www.normalesup.org Download Document from Source Website File Size: 457,07 KB Share Document on Facebook

	STUDIA UBB PHYSICA, LVI, 2, 2011 CORRELATION CLUSTERING APPROACH TO LOGICAL LEARNING CSEH GY1, NÉDA Z.1,2, D. DAVID3,4 ABSTRACT. The relation between the level of logical learning and intelligence DocID: 1tq3D - View Document
	Correlation clustering on networks DocID: 1tlbg - View Document
	JMLR: Workshop and Conference Proceedings vol 40:1–22, 2015 Correlation Clustering with Noisy Partial Information Konstantin Makarychev KOMAKARY @ MICROSOFT. COM DocID: 1taZj - View Document
	Bipartite Correlation Clustering – Maximizing Agreements Megasthenis Asteris The University of Texas at Austin Anastasios Kyrillidis DocID: 1t0VM - View Document
	Parallel Correlation Clustering on Big Graphs Xinghao Pan↵,✏ , Dimitris Papailiopoulos↵,✏ , Samet Oymak↵,✏ , Benjamin Recht↵,✏, , Kannan Ramchandran✏ , and Michael I. Jordan↵,✏, ↵ AMPLab, ✏ EECS DocID: 1sQez - View Document