Sciweavers

1395 search results - page 32 / 279
» (k, )-Distance-Hereditary Graphs
Sort
View
CORR
2011
Springer
202views Education» more  CORR 2011»
13 years 3 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
CORR
2011
Springer
138views Education» more  CORR 2011»
13 years 3 months ago
On the resilience of Hamiltonicity and optimal packing of Hamilton cycles in random graphs
Let k = (k1, . . . , kn) be a sequence of n integers. For an increasing monotone graph property P we say that a base graph G = ([n], E) is k-resilient with respect to P if for eve...
Sonny Ben-Shimon, Michael Krivelevich, Benny Sudak...
DAM
2011
13 years 3 months ago
Independence in connected graphs
We prove that if G = (VG, EG) is a finite, simple, and undirected graph with κ components and independence number α(G), then there exist a positive integer k ∈ N and a functi...
Jochen Harant, Dieter Rautenbach
COMGEO
2012
ACM
12 years 4 months ago
Algorithms for the edge-width of an embedded graph
Let G be an unweighted graph of complexity n embedded in a surface of genus g, orientable or not. We describe improved algorithms to compute a shortest non-contractible and a shor...
Sergio Cabello, Éric Colin de Verdiè...
CRYPTO
2012
Springer
268views Cryptology» more  CRYPTO 2012»
11 years 11 months ago
Secret Sharing Schemes for Very Dense Graphs
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
Amos Beimel, Oriol Farràs, Yuval Mintz