Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-Partite Graphs

First Page		Document Content
Date: 2013-11-08 11:23:34 NP-complete problems Graph operations Tree decomposition Vertex cover Minor Planar graph Dynamic programming Path decomposition Apex graph Graph theory Theoretical computer science Mathematics		Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-Partite Graphs Add to Reading List Source URL: cjtcs.cs.uchicago.edu Download Document from Source Website File Size: 263,54 KB Share Document on Facebook

	Near-Optimal Compression for the Planar Graph Metric Amir Abboud∗ Paweł Gawrychowski† Abstract DocID: 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 Ling DocID: 1uoNh - View Document
	The random planar graph process Stefanie Gerke ∗ Dirk Schlatter DocID: 1tk3p - View Document
	Using MVAPICH2-GDR for multi-GPU data parallel graph analytics T. James Lewis SYSTAP™, LLC © All Rights Reserved DocID: 1rtvU - View Document