First Page | Document Content | |
---|---|---|
Date: 2014-09-26 08:36:22Graph theory NP-complete problems Maximal independent set Independent set Dominating set Vertex cover Graph coloring Planar graph Graph minor Planar separator theorem Tree decomposition | Although the result is correct, the algorithm and analysis presented in this paper contain non-trivial errors. These have been fixed in a technical report (availabe at http://www.disco.ethz.ch/publications/planarmds_-1.pAdd to Reading ListSource URL: disco.ethz.chDownload Document from Source WebsiteFile Size: 412,96 KBShare Document on Facebook |
Near-Optimal Compression for the Planar Graph Metric Amir Abboud∗ Paweł Gawrychowski† AbstractDocID: 1vkO7 - View Document | |
Computing the Girth of a Planar Graph in O(n log n) time Oren Weimann (Weizmann Institute of Science) Raphy Yuster (University of Haifa)DocID: 1v2rQ - View Document | |
UNDER REVIEW, Gracker: A Graph-based Planar Object Tracker Tao Wang and Haibin LingDocID: 1uoNh - View Document | |
The random planar graph process Stefanie Gerke ∗ Dirk SchlatterDocID: 1tk3p - View Document | |
Using MVAPICH2-GDR for multi-GPU data parallel graph analytics T. James Lewis SYSTAP™, LLC © All Rights ReservedDocID: 1rtvU - View Document |