Sciweavers

656 search results - page 29 / 132
» Graph Theoretical Characterization and Computation of Answer...
Sort
View
COMPGEOM
2004
ACM
14 years 1 months ago
Time-varying reeb graphs for continuous space-time data
The Reeb graph is a useful tool in visualizing real-valued data obtained from computational simulations of physical processes. We characterize the evolution of the Reeb graph of a...
Herbert Edelsbrunner, John Harer, Ajith Mascarenha...
SIGMOD
2003
ACM
136views Database» more  SIGMOD 2003»
14 years 7 months ago
A Characterization of the Sensitivity of Query Optimization to Storage Access Cost Parameters
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
Frederick Reiss, Tapas Kanungo
GG
2010
Springer
13 years 7 months ago
Verification of Graph Transformation Systems with Context-Free Specifications
We introduce an analysis method for graph transformation systems which checks that certain forbidden graphs are not reachable from the start graph. These forbidden graphs are speci...
Barbara König, Javier Esparza
MFCS
2004
Springer
14 years 28 days ago
The Bidimensional Theory of Bounded-Genus Graphs
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitr...
COCO
2009
Springer
128views Algorithms» more  COCO 2009»
14 years 2 months ago
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
Per Austrin, Subhash Khot, Muli Safra