<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2010-06-29 01:29:34NP-complete problems Topological graph theory Apex graph Planar separator theorem Minor Tree decomposition Dual graph Matching Planarity testing Graph theory Planar graphs Graph operations |
| BIOINFORMATICS Vol. 30 ISMB 2014, pages i139–i148 doi:bioinformatics/btu293 Graph-regularized dual Lasso for robust eQTL mappingDocID: 1uhnm - View Document |
| Efficient Primal-‐‑Dual Graph Algorithms for Map Reduce Kamesh Munagala Duke University Joint work with Bahman BahmaniDocID: 1t6tY - View Document |
| UNIVERSITÄT DORTMUND FACHBEREICH INFORMATIK DiplomarbeitDocID: 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 aDocID: 1rccT - View Document |
| MAP EDITING USING A TOPOLOGICAL ACCESS SYSTEM Marvin White U.S. Bureau of the CensusDocID: 1qOpq - View Document |