An asymptotic analysis of labeled and unlabeled \(k\)-trees (Q308942): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-015-0039-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2096882138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The continuum random tree. III / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of labeled k-dimensional trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On non-serial dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limiting Distribution for Distances in k-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distribution of nodes of given degree in random trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Study of Subcritical Graph Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating k-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The specification of 2-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\Gamma \)-species and the enumeration of \(k\)-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting unlabeled \(k\)-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Building bridges. Between mathematics and computer science. Selected papers of the conferences held in Budapest, Hungary, August 5--9, 2008 and Keszthely, Hungary, August 11--15, 2008 and other research papers dedicated to László Lovász on the occasion of his 60th birthday / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On acyclic simplicial complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelled and unlabelled enumeration of \(k\)-gonal 2-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of labeled k-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2803343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distribution of degrees in a large random tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical algorithms on partial k-trees with an application to domination-like problems / rank
 
Normal rank

Latest revision as of 12:38, 12 July 2024

scientific article
Language Label Description Also known as
English
An asymptotic analysis of labeled and unlabeled \(k\)-trees
scientific article

    Statements

    An asymptotic analysis of labeled and unlabeled \(k\)-trees (English)
    0 references
    0 references
    0 references
    0 references
    6 September 2016
    0 references
    \(k\)-trees
    0 references
    generating function
    0 references
    singularity analysis
    0 references
    central limit theorem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references