An Optimal Algorithm for Finding Frieze–Kannan Regular Partitions (Q5364234): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Algorithmic Aspects of the Regularity Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for graph regularity and removal lemmas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Deterministic Algorithm for the Frieze–Kannan Regularity Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quick approximation to matrices and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds of tower type for Szemerédi's uniformity lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for Checking Regularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sets of integers containing k elements in arithmetic progression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200109 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1017/s0963548314000200 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2141649469 / rank
 
Normal rank

Latest revision as of 08:31, 30 July 2024

scientific article; zbMATH DE number 6785433
Language Label Description Also known as
English
An Optimal Algorithm for Finding Frieze–Kannan Regular Partitions
scientific article; zbMATH DE number 6785433

    Statements

    Identifiers

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