Eliminating cycles in the discrete torus

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3887 LNCS, Issue , 2006, Pages 202-210

  Bollobás, Béla ^a   Kindler, Guy ^b   Leader, Imre ^c   O'Donnell, Ryan ^b  

^a University of Memphis   (United States)

^b MICROSOFT RESEARCH   (United States)

^c UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; LINEAR ALGEBRA;

DISCRETE TORUS; EDGE STRUCTURES; NONTRIVIAL CYCLES;

TOPOLOGY;

EID: 33745634361     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11682462_22     Document Type: Conference Paper

References (8)

1. M. C. Azizoǧlu and Ö. Eǧecioǧlu. The isoperimetric number of d-dimensional k-ary arrays. International Journal of Foundations of Computer Science, 10(3):289-300, 1999.
2. B. Bollobás and I. Leader. An isoperimetric inequality on the discrete torus. SIAM J. Discret. Math., 3(1):32-37, 1990.
3. F. R. K. Chung and P. Tetali. Isoperimetric inequalities for cartesian products of graphs. Combinatorics, Probability & Computing, 7(2):141-148, 1998.
4. U. Feige. Error reduction by parallel repetition - the state of the art. Technical report, Weizmann Institute of Science, 1995.
5. U. Feige. Personal communication. 2005.
6. R. Raz. A parallel repetition theorem. SIAM Journal on Computing, 27(3):763-803, June 1998.
7. A. Rós. The isoperimetric problem. Lecture notes. MSRI summer school, 2001. http://www.ugr.es/~aros/isoper.htm.
8. M. E. Saks, A. Samorodnitsky, and L. Zosin. A lower bound on the integrality gap for minimum multicut in directed networks. Combinatorial, 24(3):525-530, 2004.