5100 search results - page 163 / 1020 » The Linear Complexity of a Graph |
96
Voted
CATS
2008
15 years 2 months ago
2008
We study the consistency problem for extended global cardinality (EGC) constraints. An EGC constraint consists of a set X of variables, a set D of values, a domain D(x) D for eac...
97
Voted
CADE
2006
Springer
16 years 27 days ago
2006
Springer
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
91
Voted
MLG
2007
Springer
15 years 6 months ago
2007
Springer
As a fundamental problem in pattern recognition, graph matching has found a variety of applications in the field of computer vision. In graph matching, patterns are modeled as gr...
145
click to vote
ICDM
2006
IEEE
15 years 6 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
111
Voted
SPAA
2000
ACM
15 years 5 months ago
2000
ACM
In this paper, we study the design of fault tolerant networks for arrays and meshes by adding redundant nodes and edges. For a target graph G (linear array or mesh in this paper),...