2503 search results - page 332 / 501 » A study of 3-arc graphs |
191
click to vote
DIALM
2003
ACM
15 years 11 months ago
2003
ACM
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
137
click to vote
AAAI
2007
15 years 8 months ago
2007
We introduce a new method for finding nodes semantically related to a given node in a hyperlinked graph: the Green method, based on a classical Markov chain tool. It is generic, ...
128
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
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...
177
click to vote
FSTTCS
2009
Springer
16 years 12 days ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
175
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
This paper introduces a metric that measures symmetry in tree graphs, which allows for a statistical characterization of GP solutions by their architectural "shapes." A ...