723 search results - page 92 / 145 » On the hyperbolicity constant in graphs |
178
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
181
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
136
click to vote
ISCAS
2006
IEEE
16 years 24 days ago
2006
IEEE
Synchronization in networks with different topolo- is shown that for typical systems only three main scenarios gies is studied. We show that for a large class of oscillators there ...
166
click to vote
ESA
2005
Springer
16 years 9 days ago
2005
Springer
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
200
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...