376 search results - page 11 / 76 » Near-optimum Universal Graphs for Graphs with Bounded Degree... |
STOC
2004
ACM
14 years 9 months ago
2004
ACM
In this paper, we address two longstanding questions about finding good separators in graphs of bounded genus and degree:
DM
2006
13 years 8 months ago
2006
For a graph G and k a real number, we consider the sum of the k-th powers of the degrees of the vertices of G. We present some general bounds on this sum for various values of k. ...
COMBINATORICS
1998
13 years 8 months ago
1998
Voltage graphs are a powerful tool for constructing large graphs (called lifts) with prescribed properties as covering spaces of small base graphs. This makes them suitable for ap...
DM
2008
13 years 8 months ago
2008
A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v1, . . . , vk of G, there exists a cycle (respectively, a hamilton...
CCCG
2010
13 years 10 months ago
2010
In this paper we devise a new geometric spanner based on a generalization of the known Stable Roommates algorithm. This spanner is on the "path" between the Yao graph an...