New Upper Bounds on the Decomposability of Planar Graphs*

First Page		Document Content
Date: 2007-12-20 09:05:26 Minor Tree Graph Chordal graph Dual graph Branch-decomposition Petersen graph Graph structure theorem Graph theory Planar graphs Graph operations		New Upper Bounds on the Decomposability of Planar Graphs* Add to Reading List Source URL: users.uoa.gr Download Document from Source Website File Size: 335,38 KB Share Document on Facebook

	BIOINFORMATICS Vol. 30 ISMB 2014, pages i139–i148 doi:bioinformatics/btu293 Graph-regularized dual Lasso for robust eQTL mapping DocID: 1uhnm - View Document
	Eﬃcient Primal-‐‑Dual Graph Algorithms for Map Reduce Kamesh Munagala Duke University Joint work with Bahman Bahmani DocID: 1t6tY - View Document
	UNIVERSITÄT DORTMUND FACHBEREICH INFORMATIK Diplomarbeit DocID: 1rkPg - View Document
	Chi-Han Peng & Peter Wonka / Connectivity Editing for Quad-Dominant Meshes Additional Materials Figure 17: The two possible outcomes (depending on the pvertex/d-vertex labeling) in the primal domain √ by applying a DocID: 1rccT - View Document
	MAP EDITING USING A TOPOLOGICAL ACCESS SYSTEM Marvin White U.S. Bureau of the Census DocID: 1qOpq - View Document