Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs (Q3145840): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: mctoolbox / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Mulprec / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3125518523 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57601386 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1108.6280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Methods in Scientific Computing, Volume I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4440432 / 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: On the Independent Domination Number of Random Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: MPFR / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization via enumeration: A new algorithm for the max cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Maximum Cut of a Planar Graph in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accuracy and Stability of Numerical Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced Forests in Regular Graphs with Large Girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs? / 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: The asymptotic distribution of short cycles in 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: On the bipartite density of regular graphs with large girth / rank
 
Normal rank

Latest revision as of 00:27, 6 July 2024

scientific article
Language Label Description Also known as
English
Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs
scientific article

    Statements

    Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 December 2012
    0 references
    0 references
    cubic graphs
    0 references
    random graphs
    0 references
    large girth
    0 references
    edge-cut
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references