Derandomized graph products
نویسندگان
چکیده
منابع مشابه
Derandomized Graph Product Results Using the Low Degree Long Code
In this paper, we address the question of whether the recent derandomization results obtained by the use of the low-degree long code can be extended to other product settings. We consider two settings: (1) the graph product results of Alon, Dinur, Friedgut and Sudakov [ADFS04] and (2) the “majority is stablest” type of result obtained by Dinur, Mossel and Regev [DMR09] and Dinur and Shinkar [DS...
متن کاملDerandomized Squaring of Graphs
We introduce a “derandomized” analogue of graph squaring. This operation increases the connectivity of the graph (as measured by the second eigenvalue) almost as well as squaring the graph does, yet only increases the degree of the graph by a constant factor, instead of squaring the degree. One application of this product is an alternative proof of Reingold’s recent breakthrough result that S-T...
متن کاملEdge Regular Graph Products
A regular nonempty graph Γ is called edge regular, whenever there exists a nonegative integer λΓ, such that any two adjacent vertices of Γ have precisely λΓ common neighbours. An edge regular graph Γ with at least one pair of vertices at distance 2 is called amply regular, whenever there exists a nonegative integer μΓ, such that any two vertices at distance 2 have precisely μΓ common neighbours...
متن کاملApproximate graph products
The problem of recognizing approximate graph products arises in theoretical biology. This paper presents an algorithm that recognizes a large class of approximate graph products. The main part of this contribution is concerned with a new, local prime factorization algorithm that factorizes all strong products on an extensive class of graphs that contains, in particular, all products of triangle...
متن کاملAntipodal of Graph Products
The antipodal graph of a graph G, denoted by A(G), is the graph on the same vertices as ofG, two vertices being adjacent if the distance between them is equal to the diameter of G. A graph is said to be antipodal if it is the antipodal graph A(H) of some graph H . In this paper, we consider four kinds of graph products and introduce the antipodal graph of each product with respect to the antipo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Complexity
سال: 1995
ISSN: 1016-3328,1420-8954
DOI: 10.1007/bf01277956