Cores of random \(r\)-partite hypergraphs (Q436312): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ipl.2011.10.017 / rank
Normal rank
 
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.ipl.2011.10.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2138378323 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple and Space-Efficient Minimal Perfect Hash Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Encores on cores / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3286850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3291948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the strength of connectedness of a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The first cycles in an evolving graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poisson convergence and Poisson processes with applications to random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3360223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cores in random hypergraphs and Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: A critical point for random graphs with a given degree sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Size of the Giant Component of a Random Graph with a Given Degree Sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sudden emergence of a giant \(k\)-core in a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic enumeration of sparse graphs with a minimum degree constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting connected graphs inside-out / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for covering complete uniform hypergraphs / 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: Q4263664 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IPL.2011.10.017 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:32, 9 December 2024

scientific article
Language Label Description Also known as
English
Cores of random \(r\)-partite hypergraphs
scientific article

    Statements

    Cores of random \(r\)-partite hypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    20 July 2012
    0 references
    analysis of algorithms
    0 references
    randomized algorithms
    0 references
    minimal perfect hashing
    0 references
    cores of hypergraphs
    0 references

    Identifiers

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