Sciweavers

966 search results - page 26 / 194
» Small Alliances in Graphs
Sort
View
PAMI
2006
137views more  PAMI 2006»
13 years 8 months ago
Isoperimetric Graph Partitioning for Image Segmentation
Spectral graph partitioning provides a powerful approach to image segmentation. We introduce an alternate idea that finds partitions with a small isoperimetric constant, requiring ...
Leo Grady, Eric L. Schwartz
SIAMDM
2010
111views more  SIAMDM 2010»
13 years 3 months ago
Random Walks with Look-Ahead in Scale-Free Random Graphs
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(...
Colin Cooper, Alan M. Frieze
SIGMOD
2003
ACM
102views Database» more  SIGMOD 2003»
14 years 8 months ago
Analysis of SIGMOD's co-authorship graph
In this paper we investigate the co-authorship graph obtained from all papers published at SIGMOD between 1975 and 2002. We find some interesting facts, for instance, the identity...
Mario A. Nascimento, Jörg Sander, Jeffrey Pound
EJC
2006
13 years 8 months ago
3-star factors in random d-regular graphs
The small subgraph conditioning method first appeared when Robinson and the second author showed the almost sure hamiltonicity of random d-regular graphs. Since then it has been u...
Hilda Assiyatun, Nicholas C. Wormald
CORR
2002
Springer
115views Education» more  CORR 2002»
13 years 8 months ago
Simultaneous Embedding of a Planar Graph and Its Dual on the Grid
Traditional representations of graphs and their duals suggest the requirement that the dual vertices should be placed inside their corresponding primal faces, and the edges of the ...
Cesim Erten, Stephen G. Kobourov