Sciweavers

1420 search results - page 7 / 284
» Representation of Graphs by OBDDs
Sort
View
CP
2004
Springer
14 years 4 months ago
Constraint Propagation as a Proof System
Abstract. Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraint-satisfaction problems. The generalizat...
Albert Atserias, Phokion G. Kolaitis, Moshe Y. Var...
WG
2009
Springer
14 years 5 months ago
Fully Dynamic Representations of Interval Graphs
We present a fully dynamic algorithm that maintains three different representations of an interval graph: a minimal interval model of the graph, the PQ-tree of its maximal cliques...
Christophe Crespelle
DM
2007
106views more  DM 2007»
13 years 10 months ago
The Roberts characterization of proper and unit interval graphs
In this note, a constructive proof is given that the classes of proper interval graphs and unit interval graphs coincide, a result originally established by Fred S. Roberts. Addit...
Frédéric Gardi
FEGC
2009
86views Biometrics» more  FEGC 2009»
13 years 8 months ago
Binary Sequences and Association Graphs for Fast Detection of Sequential Patterns
We develop an efficient algorithm for detecting frequent patterns that occur in sequence databases under certain constraints. By combining the use of bit vector representations of ...
Selim Mimaroglu, Dan A. Simovici
COMPGEOM
2011
ACM
13 years 2 months ago
Sphere and dot product representations of graphs
A graph G is a k-sphere graph if there are k-dimensional real vectors v1, . . . , vn such that ij ∈ E(G) if and only if the distance between vi
Ross J. Kang, Tobias Müller