A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees (Q2223687): 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.2020.12.013 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W3119903396 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for NP-complete problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Independence Ratio of Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum vertex covers and the spectrum of the normalized Laplacian on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for the domination number of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limit Laws for Sums of Functions of Subtrees of Random Binary Search Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A measure & conquer approach for the analysis of exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local tree-width, excluded minors, and approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bibliography on domination in graphs and some basic definitions of domination parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limit laws for functions of fringe trees for binary search trees and random recursive trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Set in <i>P</i><sub>5</sub>-Free Graphs in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4085740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confining sets and avoiding bottleneck cases: a simple maximum independent set algorithm in degree-3 graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for maximum independent set / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal independent sets of vertices in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for maximum independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time computability of combinatorial problems on series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inclusion/Exclusion Meets Measure and Conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002782 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2020.12.013 / rank
 
Normal rank

Latest revision as of 13:37, 17 December 2024

scientific article
Language Label Description Also known as
English
A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees
scientific article

    Statements

    A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 February 2021
    0 references
    independence number
    0 references
    domination number
    0 references
    clique cover number
    0 references
    random recursive trees
    0 references
    random binary search trees
    0 references
    fringe trees
    0 references
    central limit laws
    0 references
    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