From Semantics to Spatial Distribution (original) (raw)

The Algorithmic Aspects of the Regularity Lemma

shiva farahhan

View PDFchevron_right

Extremal hypergraph theory and algorithmic regularity lemma for sparse graphs

Hiêp Hàn

2011

View PDFchevron_right

On characterizing hypergraph regularity

Yulia Dementieva

Random Structures and Algorithms, 2002

View PDFchevron_right

Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions

Hiêp Hàn, Vojtěch Rödl

SIAM Journal on Computing, 2010

View PDFchevron_right

From The Cover: The hypergraph regularity method and its applications

Jozef Skokan

Proceedings of the National Academy of Sciences, 2005

View PDFchevron_right

Revealing Structure in Large Graphs: Szemeredi’s Regularity Lemma and Its Use in ´ Pattern Recognition

Ismail Elezi

View PDFchevron_right

On a probabilistic graph-theoretical method

Jaroslav Nešetřil

Proceedings of the American Mathematical Society, 1978

View PDFchevron_right

Regularity Lemmas and Combinatorial Algorithms

Ryan Williams

2009 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

View PDFchevron_right

Extremal Hypergraph Problems and the Regularity Method

Vojtěch Rödl

2000

View PDFchevron_right

Structural Properties of Sparse Graphs

Jaroslav Nešetřil

Electronic Notes in Discrete Mathematics, 2008

View PDFchevron_right

On the Trickness of Sparse Random Graphs

Colin Cooper

Cpc, 1992

View PDFchevron_right

Improved Upper Bounds on the Simultaneous Messages Complexity of the Generalized Addressing Function

Satyanarayana Lokam

Lecture Notes in Computer Science, 2000

View PDFchevron_right

Applications of the regularity lemma for uniform hypergraphs

Jozef Skokan, Vojtěch Rödl

Random Structures and Algorithms, 2006

View PDFchevron_right

Regularity lemmas for graphs

Vojtěch Rödl

2010

View PDFchevron_right

Hypergraphs, Quasi-randomness, and Conditions for Regularity

Jozef Skokan

Journal of Combinatorial Theory, Series A, 2002

View PDFchevron_right

Concentration and regularization of random graphs

Can Le

Random Structures & Algorithms, 2017

View PDFchevron_right

Testing versus Estimation of Graph Properties

Frank Leighton

SIAM Journal on Computing, 2007

View PDFchevron_right

Approximately Counting Embeddings into Random Graphs

Martin Fürer

Springer eBooks, 2008

View PDFchevron_right

On Fine-Grained Exact Computation in Regular Graphs

Saeed Amiri

2020

View PDFchevron_right

The de Bruijn-Erdos Theorem for hypergraphs

Keith Mellinger

2010

View PDFchevron_right

On randomly -dimensional graphs

Behnaz Omoomi

Applied Mathematics Letters, 2011

View PDFchevron_right

The null labelling of k-uniform hypergraphs and the complexity of the 2-intersection graph decision problem

Lama Tarsissi

Le Centre pour la Communication Scientifique Directe - HAL - ENPC, 2022

View PDFchevron_right

Recent research in Graph Theory

Ahmed Fawzy

View PDFchevron_right

On the Rigidity of Sparse Random Graphs

Nati Linial

Journal of Graph Theory, 2016

View PDFchevron_right

An approximate blow-up lemma for sparse pseudorandom graphs

Hiêp Hàn

Electronic Notes in Discrete Mathematics, 2013

View PDFchevron_right

The Uniformity Lemma for hypergraphs

Peter Frankl

Graphs and Combinatorics, 1992

View PDFchevron_right

An introduction to the theory of random graphs

pavan Sangha

2015

View PDFchevron_right

Regularity Lemma for k-uniform hypergraphs

Jozef Skokan

Random Structures and Algorithms, 2004

View PDFchevron_right

Strong products of hypergraphs: Unique prime factorization theorems and algorithms

Marc Hellmuth

Discrete Applied Mathematics, 2014

View PDFchevron_right

A Note on Sparse Random Graphs and Cover Graphs

Miklos Ruszinko

The Electronic Journal of Combinatorics, 2000

View PDFchevron_right

A general framework for graph sparsification

Debmalya Panigrahi

Proceedings of the 43rd annual ACM symposium on Theory of computing - STOC '11, 2011

View PDFchevron_right

A Sequential Algorithm for Generating Random Graphs

Han Kim

Algorithmica, 2009

View PDFchevron_right

Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs

Hiêp Hàn

Random Structures & Algorithms, 2021

View PDFchevron_right

Bounded Arboricity to Determine the Local Structure of Sparse Graphs

Jens Gustedt

Lecture Notes in Computer Science, 2006

View PDFchevron_right