1199 search results - page 134 / 240 » Graph Theory |
130
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
153
Voted
VALUETOOLS
2006
ACM
15 years 10 months ago
2006
ACM
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
134
click to vote
EUROPAR
2004
Springer
15 years 9 months ago
2004
Springer
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...
135
click to vote
IJON
2007
15 years 4 months ago
2007
Many conceptual studies of local cortical networks assume completely random wiring. For spatially extended networks, however, such random graph models are inadequate. The geometry...
136
click to vote
COMBINATORICA
2007
15 years 4 months ago
2007
The standard Erd˝os-Renyi model of random graphs begins with n isolated vertices, and at each round a random edge is added. Parametrizing n 2 rounds as one time unit, a phase tra...