Color-coding

@article{Alon1995Colorcoding,
  title={Color-coding},
  author={Noga Alon and Raphael Yuster and Uri Zwick},
  journal={Electron. Colloquium Comput. Complex.},
  year={1995},
  volume={TR94}
}
We describe a novel randomized method, the method of color-coding for finding simple paths and cycles of a specified length k, and other small subgraphs, within a given graph G = (V,E). The randomized algorithms obtained using this method can be derandomized using families of perfect hash functions. Using the color-coding method we obtain, in particular, the following new results: • For every fixed k, if a graph G = (V,E) contains a simple cycle of size exactly k, then such a cycle can be found… 

Divide-and-Color

This work introduces divide-and-color, a new technique for the solution of hard graph problems that first randomly colors all edges or nodes of a graph black and white, and then solves the problem recursively on the two induced parts.

On finding rainbow and colorful paths

Extensor-coding

An algorithm is devised that approximately computes the number of paths of length k in a given directed graph with n vertices up to a multiplicative error of 1 ± ε, and a deterministic 2k·poly(n) time algorithm to find a k-path in aGiven directed graph that is promised to have few of them is obtained.

On the Descriptive Complexity of Color Coding

This work characterizes—purely in terms of the syntactic structure of describing formulas—when the powerful second-order quantifiers representing a random coloring can be replaced by equivalent, simple first-order formulas in formulas describing parameterized problems.

The shortest even cycle problem is tractable

A family of finite commutative rings of characteristic 4 are designed that simultaneously give a nondegenerate representation for the generating polynomial identity via the permanent and the determinant, support efficient permanent computations by extension of Valiant’s techniques, and enable emulation of finite-field arithmetic in characteristic 2.

On Counting 3-D Matchings of Size k

A randomized algorithm that, on given positive real numbers ε and δ, and a given set S of n triples and an integer k, produces a number h in time O(5.483kn2ln (2/δ)/ε2) such that h0 is the total number of matchings of size k in the triple set S.

Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering

All the results hold in fact on any class of graphs that exclude a fixed apex graph as a minor, in particular on graphs embeddable in any fixed surface.

Counting Homomorphic Cycles in Degenerate Graphs

An algorithm for computing the number of Ck-homomorphisms in degenerate graphs is designed and it is shown that one part of its analysis can be reduced to the analysis of the fastest known algorithm for detecting directed cycles in general digraphs.

The Parameterized Complexity of the k-Biclique Problem

An f(k) ċ |G|o(√k)-time lower bound for k-Biclique for any computable function f is established and a dichotomy classification of the parameterized complexity of cardinality constraint satisfaction problems is obtained.

Algorithms and Lower Bounds for Cycles and Walks: Small Space and Sparse Graphs

A reduction is given that connects the running time of undirected 2k-cycle to finding directed odd cycles, s-t connectivity in directed graphs, and Max-3-SAT, and a space-efficient algorithms and conditional time lower bounds for finding cycles and walks in graphs are considered.
...

References

SHOWING 1-10 OF 63 REFERENCES

Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs

A novel randomized method, the method of color-coding for finding simple paths and cycles of a specified length k, and other small subgraphs, within a given graph G = (V,E), which can be derandomized using families of perfect hash functions.

Graph minors. V. Excluding a planar graph

Graph Minors. II. Algorithmic Aspects of Tree-Width

Arboricity and Subgraph Listing Algorithms

A new simple strategy into edge-searching of a graph, which is useful to the various subgraph listing problems, is introduced, and an upper bound on $a(G)$ is established for a graph $G:a (G) \leqq \lceil (2m + n)^{1/2} \rceil $, where n is the number of vertices in G.

The Spatial Complexity of Oblivious k-Probe Hash Functions

Nearly tight bounds on the spatial complexity of oblivious $O(1)$-probe hash functions, which are defined to depend solely on their search key argument are provided, establishing a significant gap between oblivious and nonoblivious search.

Finding Even Cycles Even Faster

Efficient algorithms for finding even cycles in undirected graphs and finding the shortest even cycle in an Undirected graph G=(V, E) in O(V2) time.

Graph Minors: XV. Giant Steps

Abstract Let G be a graph with a subgraph H drawn with high representativity on a surface Σ . When can the drawing of H be extended “up to 3-separations” to a drawing of G in Σ if we permit a bounded

Construction Of Asymptotically Good Low-rate Error-correcting Codes Through Pseudo-random Graphs

A novel technique, based on the pseudo-random properties of certain graphs known as expanders, is used to obtain novel simple explicit constructions of asymptotically good codes, superior to previously known explicit construction in the zero-rate neighborhood.

Small-bias probability spaces: efficient constructions and applications

It is shown how to efficiently construct a small probability space on n binary random variables such that for every subset, its parity is either zero or one with “almost” equal probability. They are
...