5606 search results - page 558 / 1122 » Randomization Techniques for Graphs. |
204
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...
212
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...
219
click to vote
DCG
2011
15 years 2 months ago
2011
We introduce an algorithm that embeds a given 3-connected planar graph as a convex 3-polytope with integer coordinates. The size of the coordinates is bounded by O(27.55n ) = O(18...
235
click to vote
SAC
2011
ACM
14 years 10 months ago
2011
ACM
We propose a novel approach and tool for collaborative software engineering and development. In model-based software engineering, the underlying data structure is a complex, direc...
220
click to vote
HICSS
2007
IEEE
16 years 1 months ago
2007
IEEE
We introduce a stochastic model that describes the quasistatic dynamics of an electric transmission network under perturbations introduced by random load fluctuations, random rem...