1729 search results - page 134 / 346 » Bound Graph Polysemy |
180
click to vote
CAAN
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. Random graphs with given expected degrees G(w) were introduced by Chung and Lu so as to extend the theory of classical G(n, p) random graphs to include random power law g...
151
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
147
click to vote
TCS
2008
15 years 6 months ago
2008
We consider computational complexity questions related to parallel knock-out schemes for graphs. In such schemes, in each round, each remaining vertex of a given graph eliminates ...
152
click to vote
JAL
2002
15 years 6 months ago
2002
Kayles is a combinatorial game on graphs. Two players select alternatingly a vertex from a given graph G - a chosen vertex may not be adjacent or equal to an already chosen vertex...
166
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...