Sciweavers

656 search results - page 62 / 132
» Graph Theoretical Characterization and Computation of Answer...
Sort
View
SARA
2007
Springer
14 years 1 months ago
Reformulation for Extensional Reasoning
Relational databases have had great industrial success in computer science. The power of the paradigm is made clear both by its widespread adoption and by theoretical analysis. Tod...
Timothy L. Hinrichs, Michael R. Genesereth
KDD
2010
ACM
214views Data Mining» more  KDD 2010»
13 years 11 months ago
Neighbor query friendly compression of social networks
Compressing social networks can substantially facilitate mining and advanced analysis of large social networks. Preferably, social networks should be compressed in a way that they...
Hossein Maserrat, Jian Pei
ESA
2009
Springer
92views Algorithms» more  ESA 2009»
14 years 2 months ago
Minimizing Movement: Fixed-Parameter Tractability
Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these proble...
Erik D. Demaine, MohammadTaghi Hajiaghayi, D&aacut...
STACS
2010
Springer
14 years 2 months ago
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, ...
GG
2008
Springer
13 years 8 months ago
Semantical Correctness and Completeness of Model Transformations Using Graph and Rule Transformation
An important requirement of model transformations is the preservation of the behavior of the original model. A model transformation is semantically correct if for each simulation r...
Hartmut Ehrig, Claudia Ermel