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

	Sage Reference Manual: Matroid Theory Release 8.3 The Sage Development Team DocID: 1uyEs - View Document
	Characterizing Graphs of Small Carving-Width R´emy Belmonte1? , Pim van ’t Hof1? , Marcin Kami´ nski3 , 2?? 4? ? ? Dani¨el Paulusma , and Dimitrios M. Thilikos DocID: 1rq3s - View Document
	ANALYTIC ZARISKI STRUCTURES AND NON-ELEMENTARY CATEGORICITY BORIS ZILBER Abstract. We study analytic Zariski structures from the point of view of non-elementary model theory. We show how to associate an abstract elementa DocID: 1rpNY - View Document
	Bonn Workshop on Combinatorial Optimization Wednesday, November 5th, 2008 Chair: Minyi Yue 09.00 – 09.30 DocID: 1rla1 - View Document
	Sampling Graphs with a Prescribed Joint Degree Distribution Using Markov Chains Isabelle Stanton∗ Ali Pinar† UC Berkeley Sandia National Laboratories‡ DocID: 1rdvb - View Document