90 search results - page 5 / 18 » Connectivity of Graphs Under Edge Flips |
CORR
2008
Springer
14 years 11 months ago
2008
Springer
A new random geometric graph model, the so-called secrecy graph, is introduced and studied. The graph represents a wireless network and includes only edges over which secure commun...
TVCG
2008
14 years 11 months ago
2008
This paper proposes novel methods for visualizing specifically the large power-law graphs that arise in sociology and the sciences. In such cases a large portion of edges can be sh...
GD
2007
Springer
15 years 5 months 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...
80
Voted
JCO
2006
14 years 11 months ago
2006
In this paper, we present a combinatorial theorem on labeling disjoint axis-parallel squares of edge length two using points. Given an arbitrary set of disjoint axis-parallel squar...
COMBINATORICA
2007
14 years 11 months ago
2007
A colored graph is a complete graph in which a color has been assigned to each edge, and a colorful cycle is a cycle in which each edge has a different color. We first show that ...