Sciweavers

3268 search results - page 410 / 654
» The hub number of a graph
Sort
View
GG
2008
Springer
15 years 7 months ago
Resolution-Like Theorem Proving for High-Level Conditions
The tautology problem is the problem to prove the validity of statements. In this paper, we present a calculus for this undecidable problem on graphical conditions, prove its sound...
Karl-Heinz Pennemann
APWEB
2010
Springer
15 years 6 months ago
A Space and Time Efficient Algorithm for SimRank Computation
SimRank has been proposed to rank web documents based on a graph model on hyperlinks. The existing techniques for conducting SimRank computation adopt an iteration computation para...
Weiren Yu, Xuemin Lin, Jiajin Le
CORR
2010
Springer
106views Education» more  CORR 2010»
15 years 6 months ago
Symmetry within Solutions
We define the concept of an internal symmetry. This is a symmety within a solution of a constraint satisfaction problem. We compare this to solution symmetry, which is a mapping b...
Marijn Heule, Toby Walsh
DM
2008
97views more  DM 2008»
15 years 6 months ago
On uniquely k-determined permutations
Motivated by a new point of view to study occurrences of consecutive patterns in permutations, we introduce the notion of uniquely k-determined permutations. We give two criteria f...
Sergey V. Avgustinovich, Sergey Kitaev
COMBINATORICA
2006
69views more  COMBINATORICA 2006»
15 years 6 months ago
Distance Sequences In Locally Infinite Vertex-Transitive Digraphs
We prove that the out-distance sequence {f+ (k)} of a vertex-transitive digraph of finite or infinite degree satisfies f+ (k + 1) f+ (k)2 for k 1, where f+ (k) denotes the numbe...
Wesley Pegden