650 search results - page 11 / 130 » Positive graphs |
SDM
2010
SIAM
14 years 11 months ago
2010
SIAM
We study the application of spectral clustering, prediction and visualization methods to graphs with negatively weighted edges. We show that several characteristic matrices of gra...
COMBINATORICA
2008
14 years 9 months ago
2008
We show that if a graph G has the property that all subsets of vertices of size n/4 contain the "correct" number of triangles one would expect to find in a random graph ...
75
Voted
EJC
2010
14 years 9 months ago
2010
In our previous paper, we presented the combinatorial theory for minimal isostatic pinned frameworks - Assur graphs - which arise in the analysis of mechanical linkages. In this p...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We propose the study of graphs that are defined by lowcomplexity distributed and deterministic agents. We suggest that this viewpoint may help introduce the element of in...
SIAMDM
2010
14 years 4 months ago
2010
If m 2 is constant and 0 r log log n for a small positive constant , then whp a random walk with look-ahead r on a scale-free graph G = G(m, n) has cover time CG(r) (2/(mr-1(...