5889 search results - page 70 / 1178 » Graph Layout Problems |
92
Voted
SIAMDM
2010
14 years 7 months ago
2010
The firefighter problem is the following discrete-time game on a graph. Initially, a fire starts at a vertex of the graph. In each round, a firefighter protects one vertex not yet ...
110
click to vote
ESA
2004
Springer
15 years 6 months ago
2004
Springer
Our work is motivated by the problem of managing data on storage devices, typically a set of disks. Such storage servers are used as web servers or multimedia servers, for handling...
101
click to vote
IPMU
2010
Springer
15 years 2 months ago
2010
Springer
We define and study the link prediction problem in bipartite networks, specializing general link prediction algorithms to the bipartite case. In a graph, a link prediction functio...
144
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
107
Voted
CGF
2010
15 years 22 days ago
2010
We present a new approach aimed at understanding the structure of connections in edge-bundling layouts. We combine the advantages of edge bundles with a bundle-centric simplified ...