Sciweavers

521 search results - page 3 / 105
» Reduction Strategies and Acyclicity
Sort
View
SAC
2009
ACM
13 years 11 months ago
Visualization of clustered directed acyclic graphs with node interleaving
Graph drawing and visualization represent structural information ams of abstract graphs and networks. An important subset of graphs is directed acyclic graphs (DAGs). E-Spring alg...
Pushpa Kumar, Kang Zhang
FOCS
1998
IEEE
13 years 9 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
FM
2006
Springer
146views Formal Methods» more  FM 2006»
13 years 8 months ago
Exact and Approximate Strategies for Symmetry Reduction in Model Checking
Symmetry reduction techniques can help to combat the state space explosion problem for model checking, but are restricted by the hard problem of determining equivalence of states d...
Alastair F. Donaldson, Alice Miller
APPINF
2003
13 years 6 months ago
Fast Recursive Data Processing in Graphs using Reduction
This paper presents an algorithm for recursive data processing in directed graphs. The proposed algorithm applies graph reduction in order to determine both starting points and a ...
J. H. ter Bekke, J. A. Bakker
ALP
1994
Springer
13 years 9 months ago
A Sequential Reduction Strategy
Kennaway proved the remarkable result that every (almost) orthogonal term rewriting system admits a computable sequential normalizing reduction strategy. In this paper we present ...
Sergio Antoy, Aart Middeldorp