Sciweavers

270 search results - page 3 / 54
» Diameter bounds for planar graphs
Sort
View
ARSCOM
2005
98views more  ARSCOM 2005»
13 years 6 months ago
Supereulerian planar graphs
We investigate the supereulerian graph problems within planar graphs, and we prove that if a 2-edge-connected planar graph G is at most three edges short of having two edge-disjoi...
Hong-Jian Lai, Deying Li, Jingzhong Mao, Mingquan ...
CORR
2011
Springer
202views Education» more  CORR 2011»
13 years 1 months ago
High Degree Vertices, Eigenvalues and Diameter of Random Apollonian Networks
ABSTRACT. Upon the discovery of power laws [8, 16, 30], a large body of work in complex network analysis has focused on developing generative models of graphs which mimick real-wor...
Alan M. Frieze, Charalampos E. Tsourakakis
EJC
2006
13 years 6 months ago
Improving diameter bounds for distance-regular graphs
In this paper we study the sequence (ci)0id for a distance-regular graph. In particular we show that if d 2j and cj = c > 1 then c2j > c holds. Using this we give improveme...
Sejeong Bang, Akira Hiraki, Jacobus H. Koolen
JEA
2008
64views more  JEA 2008»
13 years 6 months ago
Fast computation of empirically tight bounds for the diameter of massive graphs
Clémence Magnien, Matthieu Latapy, Michel H...
JMIV
2006
78views more  JMIV 2006»
13 years 6 months ago
Shape Estimation from Support and Diameter Functions
We address the problem of reconstructing a planar shape from a finite number of noisy measurements of its support function or its diameter function. New linear and non-linear algor...
Amyn Poonawala, Peyman Milanfar, Richard J. Gardne...