Bounded arboricity to determine the local structure of sparse graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4271 LNCS, Issue , 2006, Pages 159-167

  Goel, Gaurav ^a,b   Gustedt, Jens ^a,c  

^a INRIA   (France)

^b INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

^c LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; LINEARIZATION; MATHEMATICAL MODELS; PROBABILITY; VECTORS;

ERDOS RENYI GRAPHS; PROBABILITY VECTORS; SPARSE GRAPHS; TIME COMPLEXITY;

GRAPH THEORY;

EID: 33845548440     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11917496_15     Document Type: Conference Paper

References (15)

1. W. Aiello, F. Chung, and L. Lu. Random evolution in massive graphs. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pages 510-519, 2001. URL citeseer.ifi.unizh.ch/article/aiello01random. html.
2. Albert-László Barabási and Réka Albert. Emergence of scaling in random networks. Science, 286:509-512, 1999.
3. Hans Leo Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput., 25(1305-1317), 1996.
4. David Cheriton and Robert Endre Tarjan. Finding minimum spanning trees. SIAM J. Computing, 5:724-742, 1976.
5. F. K. H. A. Dehne, W. Dittrich, and D. Hutchinson. Efficient external memory algorithms by simulating coarse-grained parallel algorithms. In ACM Symposium on Parallel Algorithms and Architectures, pages 106-115, 1997.
6. Christophe Fiorio and Jens Gustedt. Two linear time union-find strategies for image processing. Theoretical Computer Science, 154:165-181, 1996.
7. Steven Fortune and James Wyllie. Parallelism in random access machines. In 10th ACM Symposium on Theory of Computing, pages 114-118, May 1978.
8. Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, and Jan Arne Telle. PRO: a model for parallel resource-optimal computation. In 16th Annual International Symposium on High Performance Computing Systems and Applications, pages 106-113. IEEE, The Institute of Electrical and Electronics Engineers, 2002.
9. Jens Gustedt. Minimum spanning trees for minor-closed graph classes in parallel. In Symposium on Theoretical Aspects of Computer Science, pages 421-431, 1998.
10. Jens Gustedt. Towards realistic implementations of external memory algorithms using a coarse grained paradigm. In International Conference on Computational Science and its Applications (ICCSA 2003), part II, number 2668 in LNCS, pages 269-278. Springer, 2003.
11. S. Kannan, M. Naor, and S. Rudich. Implicit representation of graphs. SIAM Journal On Discrete Mathematics, 5:596-603, November 1992. URL citeseer.ifi.unizh.ch/kannan92implicit.html.
12. Matthieu Latapy and Pascal Pons. Computing communities in large networks using random walks. In ISCIS'05, pages 284-293, 2005.
13. W. Mader. Homomorphieeigenschaften und mittlere Kantendichte von Graphen. Math. Ann., 174:265-268, 1967.
14. Crispin St. John Alvah Nash-Williams. Edge-disjoint spanning trees of finite graphs. J. London Math. Soc. (2), 36:445-450, 1961.
15. L. G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8): 103-111, 1990.