First Page | Document Content | |
---|---|---|
![]() Date: 2013-11-08 11:23:34NP-complete problems Graph operations Tree decomposition Vertex cover Minor Planar graph Dynamic programming Path decomposition Apex graph Graph theory Theoretical computer science Mathematics | Add to Reading List |
![]() | Minimal Disconnected Cuts in Planar Graphs ? Marcin Kami´ nski1 , Dani¨el Paulusma2 ,DocID: 1pSEP - View Document |
![]() | Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface Petr Hlinˇ en´ y1 and Markus Chimani2 1DocID: 17QQE - View Document |
![]() | A Tighter Insertion-based Approximation of the Crossing Number Markus Chimani⋆1 and Petr Hlinˇen´ y⋆⋆ 2 1DocID: 17zx5 - View Document |
![]() | Weizmann Institute of Science Thesis for the degree Master of Science Submitted to the Scientific Council of the Weizmann Institute of Science Rehovot, IsraelDocID: 16bav - View Document |
![]() | Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-Partite GraphsDocID: 13hhP - View Document |