3267 search results - page 81 / 654 » Generalized quasirandom graphs |
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We formulate weighted graph clustering as a prediction problem1 : given a subset of edge weights we analyze the ability of graph clustering to predict the remaining edge weights. ...
PODC
2006
ACM
15 years 5 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
ADHOCNOW
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. This paper presents an algorithm for constructing a spanner for ad hoc networks whose nodes have variable transmission range. Almost all previous spanner constructions fo...
109
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The oriented chromatic number of an oriented graph G is the minimum order of an oriented graph H such that G admits a homomorphism to H. The oriented chromatic number of an undire...
111
click to vote
WAW
2007
Springer
15 years 5 months ago
2007
Springer
Inspired by the recent interest in combining geometry with random graph models, we explore in this paper two generalizations of the random dot product graph model proposed by Kraet...