275 search results - page 41 / 55 » Bounding the Number of Edges in Permutation Graphs |
CCCG
2008
13 years 8 months ago
2008
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
STOC
2010
ACM
14 years 7 days ago
2010
ACM
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
SODA
2012
ACM
11 years 9 months ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
WAOA
2005
Springer
14 years 26 days ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
GD
1998
Springer
13 years 11 months ago
1998
Springer
We demonstrate the H3Viewer graph drawing library, which can be run from a standalone program or in conjunction with other programs such as SGI's Site Manager application. Our...