Sciweavers

307 search results - page 41 / 62
» Finite locally-quasiprimitive graphs
Sort
View
CORR
2010
Springer
126views Education» more  CORR 2010»
13 years 10 months ago
Asymptotic Traffic Flow in an Hyperbolic Network I: Definition and Properties of the Core
In this work we study the asymptotic traffic behaviour for Gromov's hyperbolic networks as the size of the network increases. We prove that under certain mild hypothesis the t...
Yuliy Baryshnikov, Gabriel H. Tucci
DM
2008
97views more  DM 2008»
13 years 10 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»
13 years 10 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
DAM
2006
81views more  DAM 2006»
13 years 10 months ago
Equivalence-free exhaustive generation of matroid representations
Abstract. In this paper we present an algorithm for the problem of exhaustive equivalence-free generation of 3-connected matroids which are represented by a matrix over some finite...
Petr Hlinený
ENTCS
2006
109views more  ENTCS 2006»
13 years 10 months ago
Specifications via Realizability
We present a system, called RZ, for automatic generation of program specifications from mathematical theories. We translate mathematical theories to specifications by computing th...
Andrej Bauer, Christopher A. Stone