94 search results - page 8 / 19 » On Regular Factors in Regular Graphs with Small Radius |
GD
2004
Springer
15 years 3 months ago
2004
Springer
A radial drawing is a representation of a graph in which the vertices lie on concentric circles of finite radius. In this paper we study the problem of computing radial drawings ...
WADS
2007
Springer
15 years 4 months ago
2007
Springer
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
IPPS
1999
IEEE
15 years 2 months ago
1999
IEEE
Multihop lightwave networks are becoming increasingly popular in optical networks. It is attractive to consider regular graphs as the logical topology for a multihop network, due t...
IJAC
2007
14 years 9 months ago
2007
In this article we show that every group with a finite presentation satisfying one or both of the small cancellation conditions C (1/6) and C (1/4) − T (4) has the property that...
WAW
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We study the relation between PageRank and other parameters of information networks such as in-degree, out-degree, and the fraction of dangling nodes. We model this relat...