Sciweavers

2125 search results - page 141 / 425
» On Graph Complexity
Sort
View
DATE
2007
IEEE
101views Hardware» more  DATE 2007»
15 years 4 months ago
Polynomial-time subgraph enumeration for automated instruction set extension
This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex subgraphs under the given constraint in polynomial time ...
Paolo Bonzini, Laura Pozzi
MFCS
2007
Springer
15 years 4 months ago
Hardness Results for Tournament Isomorphism and Automorphism
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
Fabian Wagner
VLDB
1993
ACM
121views Database» more  VLDB 1993»
15 years 2 months ago
Integrity Constraint and Rule Maintenance in Temporal Deductive Knowledge Bases
The enforcement of semantic integrity constraints in data and knowledge bases constitutea a major performance bottleneck. Integrity constraint simplification methods aim at reduci...
Dimitris Plexousakis
APVIS
2004
14 years 11 months ago
Optimal Leaf Ordering for Two and a Half Dimensional Phylogenetic Tree Visualisation
Two and a half dimensional graph visualisation is the stacking of a set of related graphs into the third dimension to support visual comparison. A new aesthetic criterion is intro...
Tim Dwyer, Falk Schreiber
MICRO
2009
IEEE
132views Hardware» more  MICRO 2009»
15 years 4 months ago
Finding concurrency bugs with context-aware communication graphs
Incorrect thread synchronization often leads to concurrency bugs that manifest nondeterministically and are difficult to detect and fix. Past work on detecting concurrency bugs ...
Brandon Lucia, Luis Ceze