Scaling laws for maximum coloring of random geometric graphs (Q516873): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3425132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5729634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The jackknife estimate of variance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Analysis of the Held and Karp Lower Bound for the Euclidean Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3855869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of random geometric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph colouring and the probabilistic method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matching problem and subadditive Euclidean functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subadditive Euclidean functionals and nonlinear growth in geometric probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limit Theorems in Discrete Stochastic Geometry / rank
 
Normal rank

Revision as of 12:56, 13 July 2024

scientific article
Language Label Description Also known as
English
Scaling laws for maximum coloring of random geometric graphs
scientific article

    Statements

    Identifiers

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