Sciweavers

2270 search results - page 42 / 454
» On the distribution of eigenvalues of graphs
Sort
View
CLUSTER
2011
IEEE
14 years 1 months ago
Achieving Scalable Parallelization for the Hessenberg Factorization
—Much of dense linear algebra has been successfully blocked to concentrate the majority of its time in the Level 3 BLAS, which are not only efficient for serial computation, but...
Anthony M. Castaldo, R. Clint Whaley
CPC
2006
93views more  CPC 2006»
15 years 1 months ago
Generating Outerplanar Graphs Uniformly at Random
We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a c...
Manuel Bodirsky, Mihyun Kang
WAW
2007
Springer
120views Algorithms» more  WAW 2007»
15 years 8 months ago
Giant Component and Connectivity in Geographical Threshold Graphs
The geographical threshold graph model is a random graph model with nodes distributed in a Euclidean space and edges assigned through a function of distance and node weights. We st...
Milan Bradonjic, Aric A. Hagberg, Allon G. Percus
WAW
2007
Springer
122views Algorithms» more  WAW 2007»
15 years 8 months ago
A Geometric Preferential Attachment Model of Networks II
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. This model yields a graph with power-law degree distributio...
Abraham D. Flaxman, Alan M. Frieze, Juan Vera
COMPGEOM
2009
ACM
15 years 8 months ago
Randomly removing g handles at once
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
Glencora Borradaile, James R. Lee, Anastasios Sidi...