Sciweavers

193 search results - page 6 / 39
» The structure of almost all graphs in a hereditary property
Sort
View
RSA
2011
89views more  RSA 2011»
13 years 2 months ago
Excluding induced subgraphs: Critical graphs
Determining the cardinality and describing the structure of H-free graphs is wellinvestigated for many graphs H. In the nineties, Prömel and Steger proved that for a graph H with...
József Balogh, Jane Butterfield
STOC
2003
ACM
126views Algorithms» more  STOC 2003»
14 years 7 months ago
A new approach to dynamic all pairs shortest paths
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
Camil Demetrescu, Giuseppe F. Italiano
DAM
1999
114views more  DAM 1999»
13 years 7 months ago
Perfect and Almost Perfect Sequences
The autocorrelation function of a sequence is a measure for how much the given sequence di ers from its translates. Periodic binary sequences with good correlation properties have...
Dieter Jungnickel, Alexander Pott
IM
2007
13 years 7 months ago
Infinite Limits and Adjacency Properties of a Generalized Copying Model
We present a new model for self-organizing networks such as the web graph, and analyze its limit behaviour. In the model, new vertices are introduced over time that copy the neighb...
Anthony Bonato, Jeannette C. M. Janssen
TKDE
2008
154views more  TKDE 2008»
13 years 7 months ago
Analyzing the Structure and Evolution of Massive Telecom Graphs
Abstract-- With ever growing competition in telecommunications markets, operators have to increasingly rely on business intelligence to offer the right incentives to their customer...
Amit Anil Nanavati, Rahul Singh, Dipanjan Chakrabo...