Jump to Content
Your Recent History
View Cart
Logged Out Log In
SIAM J. Discrete Math. 26, pp. 15-29 (15 pages)
A Deterministic Algorithm for the Frieze–Kannan Regularity Lemma
Alerts
Alert Me When Cited
Alert Me When Corrected
Tools
Download Citation
Add to MyScitation
Blog This Article
Print-Friendly
Research Toolkit
Share
Email Abstract
Connotea
CiteULike
del.icio.us
BibSonomy
Tweet this Article
Add to FacebookThe Frieze–Kannan regularity lemma is a powerful tool in combinatorics. It has also found applications in the design of approximation algorithms and recently in the design of fast combinatorial algorithms for boolean matrix multiplication. The algorithmic applications of this lemma require one to efficiently construct a partition satisfying the conditions of the lemma. R. Williams recently asked if one can construct a partition satisfying the conditions of the Frieze–Kannan regularity lemma in deterministic subcubic time. We resolve this problem by designing an $\tilde O(n^{\omega})$ time algorithm for constructing such a partition, where $\omega < 2.376$ is the exponent of fast matrix multiplication. The algorithm relies on a spectral characterization of vertex partitions satisfying the properties of the Frieze–Kannan regularity lemma.
© 2012 Society for Industrial and Applied Mathematics
RELATED DATABASES
To view database links for this article,
you need to log in.
KEYWORDS
PUBLICATION DATA
ARTICLE DATA
History
Received August 31, 2011
Accepted October 07, 2011
Published online January 03, 2012
Accepted October 07, 2011
Published online January 03, 2012
Digital Object Identifier
For access to fully linked references, you need to log in.
ALL SIAM Content
Scitation
Google Scholar