Pages that link to "Item:Q4289842"
From MaRDI portal
The following pages link to The Algorithmic Aspects of the Regularity Lemma (Q4289842):
Displaying 50 items.
- Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
- Hamilton cycles in dense vertex-transitive graphs (Q462925) (← links)
- On the KŁR conjecture in random graphs (Q476516) (← links)
- Hardness and algorithms for rainbow connection (Q491198) (← links)
- An approximate version of Sumner's universal tournament conjecture (Q651033) (← links)
- Integer and fractional packings of hypergraphs (Q864903) (← links)
- Packing directed cycles efficiently (Q867851) (← links)
- Spanning 3-colourable subgraphs of small bandwidth in dense graphs (Q933679) (← links)
- Finding bipartite subgraphs efficiently (Q991744) (← links)
- A fast parallel algorithm for finding Hamiltonian cycles in dense graphs (Q1024477) (← links)
- Lepp-bisection algorithms, applications and mathematical properties (Q1030788) (← links)
- Highly connected coloured subgraphs via the regularity Lemma (Q1045023) (← links)
- Short paths in \(\varepsilon \)-regular pairs and small diameter decompositions of dense graphs (Q1045170) (← links)
- Cycle factors in dense graphs (Q1292839) (← links)
- Hypergraphs, quasi-randomness, and conditions for regularity (Q1604564) (← links)
- Weak internal partition of regular graphs (Q1690616) (← links)
- Graph summarization with quality guarantees (Q1741300) (← links)
- Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs (Q1749486) (← links)
- Proof of a conjecture of Bollobás and Kohayakawa on the Erdős-Stone theorem (Q1850610) (← links)
- Embedding graphs with bounded degree in sparse pseudorandom graphs (Q1885587) (← links)
- Bounds for graph regularity and removal lemmas (Q1930904) (← links)
- Rainbow connections of graphs: a survey (Q1938889) (← links)
- Regularity lemmas for clustering graphs (Q2020028) (← links)
- Induced arithmetic removal: complexity 1 patterns over finite fields (Q2142699) (← links)
- On the local structure of oriented graphs -- a case study in flag algebras (Q2170792) (← links)
- The edit distance function of some graphs (Q2175239) (← links)
- Efficient removal lemmas for matrices (Q2183099) (← links)
- The maximum spectral radius of graphs without friendship subgraphs (Q2209893) (← links)
- Regular partitions of gentle graphs (Q2216929) (← links)
- Minimum \(H\)-decompositions of graphs (Q2384810) (← links)
- Additive approximation for edge-deletion problems (Q2389218) (← links)
- Hamilton decompositions of regular expanders: applications (Q2434714) (← links)
- Extremal results in sparse pseudorandom graphs (Q2445889) (← links)
- Threshold behavior of multi-path random key pre-distribution for sparse wireless sensor networks (Q2450522) (← links)
- Almost given length cycles in digraphs (Q2482351) (← links)
- Large planar subgraphs in dense graphs (Q2573646) (← links)
- Spectral extremal graphs for disjoint cliques (Q2684892) (← links)
- Grothendieck-type inequalities in combinatorial optimization (Q2892967) (← links)
- The effect of induced subgraphs on quasi-randomness (Q3055880) (← links)
- A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma (Q3088120) (← links)
- Weak quasi-randomness for uniform hypergraphs (Q3119042) (← links)
- Testing Odd-Cycle-Freeness in Boolean Functions (Q3168444) (← links)
- Path and cycle decompositions of dense graphs (Q3384033) (← links)
- Every Monotone 3-Graph Property is Testable (Q3439395) (← links)
- A Folkman Linear Family (Q3449860) (← links)
- The correctness of algebraic closures of finite degree of a family of estimate-computing algorithms for regular problems (Q3802666) (← links)
- An algorithmic version of the blow-up lemma (Q4240605) (← links)
- Random graphs with monochromatic triangles in every edge coloring (Q4286293) (← links)
- Regular pairs in sparse random graphs I (Q4419289) (← links)
- (Q4508358) (← links)
