First Page | Document Content | |
---|---|---|
![]() Date: 2005-04-19 11:59:25Graph coloring Mathematical logic Four color theorem Mathematical proof Planar graph Jordan curve theorem Theorem Kempe chain Euler characteristic Mathematics Graph theory Logic | Source URL: research.microsoft.comDownload Document from Source WebsiteFile Size: 593,26 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 |