On the threshold of having a linear treewidth in random graphs

Authors:
Yong Gao
Affiliations:
The Irving K. Barber School of Arts and Sciences, University of British Columbia Okanagan, Kelowna, Canada
Venue:
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Year:
2006

Citing 6
Cited 4

Topological parameters for time-space tradeoff

Artificial Intelligence
A sharp threshold in proof complexity

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Phase transitions and typical-case complexity: easy (hard) aspects of hard (easy) problems

Phase transitions and typical-case complexity: easy (hard) aspects of hard (easy) problems
Where the really hard problems are

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Editorial: Special Issue on Typical Case Complexity and Phase Transitions

Discrete Applied Mathematics

A note on treewidth in random graphs

COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs

Discrete Applied Mathematics
Rank-width of random graphs

Journal of Graph Theory
On the tree-depth of random graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The concept of tree-width and tree-decomposition of a graph plays an important role in algorithms and graph theory. Many NP-hard problems have been shown to be polynomially sovable when restricted to the class of instances with a bounded tree-width. In this paper, we establish an improved lower bound on the threshold for a random graph to have a linear treewidth, which improves the previous result by Kloks [1].