2503 search results - page 117 / 501 » A study of 3-arc graphs |
150
click to vote
COCOA
2009
Springer
16 years 23 days ago
2009
Springer
Abstract. We study Facility Location games played by n agents situated on the nodes of a graph. Each agent orders installation of a facility at a node of the graph and pays connect...
154
click to vote
CGO
2007
IEEE
16 years 16 days ago
2007
IEEE
Memory transfers are becoming more important to optimize, for both performance and power consumption. With this goal in mind, new register allocation schemes are developed, which ...
161
click to vote
ICC
2007
IEEE
16 years 15 days ago
2007
IEEE
— Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation, or message-passing, algorithm over the factor graph of the code. The tradi...
152
click to vote
GD
2007
Springer
16 years 10 days ago
2007
Springer
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...
186
click to vote
WAW
2007
Springer
16 years 9 days 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...