First Page | Document Content | |
---|---|---|
![]() Date: 2006-11-01 16:37:33Planar graphs Graph operations Graph coloring Clique-sum Tree decomposition Path decomposition Minor Branch-decomposition Bidimensionality Graph theory Theoretical computer science NP-complete problems | Source URL: www-math.mit.eduDownload Document from Source WebsiteFile Size: 177,06 KBShare Document on Facebook |
![]() | Characterizing Graphs of Small Carving-Width R´emy Belmonte1? , Pim van ’t Hof1? , Marcin Kami´ nski3 , 2?? 4? ? ? Dani¨el Paulusma , and Dimitrios M. ThilikosDocID: 1rq3s - View Document |
![]() | 65 Documenta Math. Column Generation for Linear and Integer Programming George L. NemhauserDocID: 1oBMa - View Document |
![]() | PDF DocumentDocID: 1jakd - View Document |
![]() | Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs Philip N. Klein∗†1 , Claire Mathieu†2 , and Hang Zhou†3 1 Brown University, United StatesDocID: 19EQA - View Document |
![]() | Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids? Petr Hlinˇ en´ y School of Mathematical and Computing Sciences,DocID: 18WF4 - View Document |