3267 search results - page 317 / 654 » Generalized quasirandom graphs |
183
click to vote
CORR
2000
Springer
15 years 6 months ago
2000
Springer
We describe a formal model for annotating linguistic artifacts, from which we derive an application programming interface (API) to a tools for manipulating these annotations. The ...
189
click to vote
JUCS
2002
15 years 6 months ago
2002
: Let G = (V, E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deterministic finite automaton is obtained if the edges are colored with k colors i...
203
click to vote
MICS
2010
15 years 5 months ago
2010
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
177
click to vote
NETWORKS
2010
15 years 5 months ago
2010
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
193
click to vote
NETWORKS
2010
15 years 5 months ago
2010
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...