scientific article; zbMATH DE number 1256685

MaRDI QIDQ4230372zbMATH OpenFDO

Authors Noga Alon, Richard A. Duke, Hanno Lefmann, Vojtěch Rödl, Raphael Yuster

Publication date 28 April 1999

zbMATH Keywords

graph coloringgraph embeddingregular partitionsequential and parallel algorithms

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The Algorithmic Aspects of the Regularity Lemma
• scientific article; zbMATH DE number 1512671
• On regularity lemmas and their algorithmic applications
• Approximate hypergraph partitioning and applications
• An Algorithmic Regularity Lemma for Hypergraphs

Cited in

(27)

• A simple algorithm for constructing Szemerédi's regularity partition
• The hardness of approximation: Gap location
• Ramsey properties of random hypergraphs
• Hypergraphs, quasi-randomness, and conditions for regularity
• Accuracy criterion for mean field approximations of Markov processes on hypergraphs
• Hardness of fully dense problems
• A deterministic algorithm for the Frieze-Kannan regularity lemma
• Regularity lemmas and combinatorial algorithms
• A deterministic algorithm for the Frieze-Kannan regularity lemma
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Can a Graph Have Distinct Regular Partitions?
• The correctness of algebraic closures of finite degree of a family of estimate-computing algorithms for regular problems
• An algorithmic version of the blow-up lemma
• The Algorithmic Aspects of the Regularity Lemma
• An Optimal Algorithm for Checking Regularity
• scientific article; zbMATH DE number 1512671 (Why is no real title available?)
• Testing subgraphs in large graphs
• scientific article; zbMATH DE number 2119673 (Why is no real title available?)
• NOTES ON THE STABLE REGULARITY LEMMA
• Regularity Lemmas and Combinatorial Algorithms
• Can a graph have distinct regular partitions?
• On regularity lemmas and their algorithmic applications
• Parent-identifying codes
• Some Cubic Time Regularity Algorithms for Triple Systems
• On regularity lemma and barriers in streaming and dynamic matching
• Regular decomposition of the edge set of a graph with applications
• On finding randomly planted cliques in arbitrary graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4230372)