Coloring random graphs (Q5056148): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1159189
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Martin Fuerer / 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.1007/3-540-55706-7_24 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1501620852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The solution of some random NP-hard problems in polynomial expected time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating quasi-random sequences from semi-random sources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost all k-colorable graphs are easy to color / rank
 
Normal rank

Latest revision as of 03:06, 31 July 2024

scientific article; zbMATH DE number 7631664
Language Label Description Also known as
English
Coloring random graphs
scientific article; zbMATH DE number 7631664

    Statements

    Identifiers