Properties of regular graphs with large girth via local algorithms (Q326821): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Nicholas C. Wormald / rank
Normal rank
 
Property / author
 
Property / author: Nicholas C. Wormald / rank
 
Normal rank
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.1016/j.jctb.2016.07.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2516346504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invariant Gaussian processes and independent sets on regular graphs of large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the max and min bisection of random cubic and random 4-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the bisection width for random \(d\)-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected domination of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large independent sets in random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits of local algorithms over sparse random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Girth and Independence Ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of regular graphs with large girth via local algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Power Dominating Sets of Random Cubic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional colorings of cubic graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large independent sets in regular graphs of large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds on the bisection width of 3- and 4-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the independence number of triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the independence number of triangle-free graphs. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring Random 4-Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring Random Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differential equations for random processes and random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of greedy algorithms on graphs with bounded degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the bipartite density of regular graphs with large girth / rank
 
Normal rank

Latest revision as of 18:00, 12 July 2024

scientific article
Language Label Description Also known as
English
Properties of regular graphs with large girth via local algorithms
scientific article

    Statements

    Properties of regular graphs with large girth via local algorithms (English)
    0 references
    0 references
    0 references
    12 October 2016
    0 references
    0 references
    large-girth graphs
    0 references
    random regular graphs
    0 references
    local algorithms
    0 references
    0 references