1447 search results - page 124 / 290 » Graphs and Path Equilibria |
115
click to vote
SPAA
2003
ACM
15 years 9 months ago
2003
ACM
This paper proves that for every positive integers n and k, we can explicitly construct a graph G with n+O(k) vertices and maximum degree 3, such that even after removing any k ve...
135
click to vote
ICPP
2006
IEEE
15 years 10 months ago
2006
IEEE
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
125
click to vote
INFOCOM
2003
IEEE
15 years 9 months ago
2003
IEEE
— Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute-like methods have led s...
174
click to vote
SIGGRAPH
1997
ACM
15 years 8 months ago
1997
ACM
We present a new Monte Carlo method for solving the light transport problem, inspired by the Metropolis sampling method in computational physics. To render an image, we generate a...
129
click to vote
IMCSIT
2010
15 years 2 months ago
2010
We will consider balanced directed graphs, i.e., graphs of binary relations, for which the number of inputs and number of outputs are the same for each vertex. The commutative diag...