On the tree-depth of random graphs (Q2442213): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2012.10.031 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2012.10.031 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1709839140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring with no 2-colored \(P_4\)'s / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mixing time of the giant component of a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4942652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3740904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden graphs for tree-depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3286850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Threshold of Having a Linear Treewidth in Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orderings on graphs and game coloring number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-width of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Role of Elimination Trees in Sparse Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4705337 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical random graphs: Diameter and mixing time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-depth, subgraph coloring and homomorphism bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity. Graphs, structures, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the order of countable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the height of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Implementation of Sparse Gaussian Elimination / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2012.10.031 / rank
 
Normal rank

Latest revision as of 16:16, 18 December 2024

scientific article
Language Label Description Also known as
English
On the tree-depth of random graphs
scientific article

    Statements

    On the tree-depth of random graphs (English)
    0 references
    0 references
    0 references
    2 April 2014
    0 references
    tree-depth
    0 references
    tree-width
    0 references
    random graphs
    0 references

    Identifiers