721 search results - page 82 / 145 » Bounds on the k-domination number of a graph |
108
click to vote
WAW
2007
Springer
15 years 6 months ago
2007
Springer
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
GD
2004
Springer
15 years 5 months ago
2004
Springer
The no-three-in-line problem, introduced by Dudeney in 1917, asks for the maximum number of points in the n × n grid with no three points collinear. In 1951, Erd¨os proved that t...
101
click to vote
SPAA
2006
ACM
15 years 5 months ago
2006
ACM
Synchronization is often necessary in parallel computing, but it can create delays whenever the receiving processor is idle, waiting for the information to arrive. This is especia...
WEA
2005
Springer
15 years 5 months ago
2005
Springer
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
105
click to vote
DIALM
2005
ACM
15 years 1 months ago
2005
ACM
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...