Treewidth of Erdős–Rényi random graphs, random intersection graphs, and scale-free random graphs-Reference-Cited by-同舟云学术

Treewidth of Erdős–Rényi random graphs, random intersection graphs, and scale-free random graphs

Published:2012-03 Issue:4-5 Volume:160 Page:566-578
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Gao Yong

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference27 articles.

1. D. Achlioptas, Threshold phenomena in random graph colouring and satisfiability, Ph.D. Thesis, Department of Computer Science, University of Toronto, Toronton, Canada, 1999.

2. A sharp threshold for k-colorability;Achlioptas;Random Structures and Algorithms,1999

3. Statistical mechanics of complex networks;Albert;Reviews of Modern Physics,2002

4. Coloring random intersection graphs and complex networks;Behrisch;SIAM Journal on Discrete Mathematics,2008

5. I. Benjamini, G. Kozma, N. Wormald, The mixing time of the giant component of a random graph, Technical Report, 2006. arXiv:0610459.

Cited by 20 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Graph-Neural-Network-Powered Solver Framework for Graph Optimization Problems;IEEE Transactions on Neural Networks and Learning Systems;2024-09

2. To Store or Not to Store: a graph theoretical approach for Dataset Versioning;2024 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2024-05-27

3. A Heuristic Approach for Determining Efficient Vaccination Plans under a SARS-CoV-2 Epidemic Model;Mathematics;2023-02-07

4. On the tree-depth and tree-width in heterogeneous random graphs;Proceedings of the Japan Academy, Series A, Mathematical Sciences;2022-11-11

5. Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs;Journal of Computer and System Sciences;2019-11