Random Structures & Algorithms

Copyright © 2012 Wiley Periodicals, Inc., A Wiley Company

Cover image for Random Structures & Algorithms

March 2001

Volume 18, Issue 2

Pages 101–200

    1. Very rapidly mixing Markov chains for 2Δ-colorings and for independent sets in a graph with maximum degree 4 (pages 101–115)

      Michael Molloy

      Article first published online: 26 JAN 2001 | DOI: 10.1002/1098-2418(200103)18:2<101::AID-RSA1000>3.0.CO;2-D

    2. Algorithms for graph partitioning on the planted partition model (pages 116–140)

      Anne Condon and Richard M. Karp

      Article first published online: 26 JAN 2001 | DOI: 10.1002/1098-2418(200103)18:2<116::AID-RSA1001>3.0.CO;2-2

    3. Biased positional games and the phase transition (pages 141–152)

      Małgorzata Bednarska and Tomasz Łuczak

      Article first published online: 26 JAN 2001 | DOI: 10.1002/1098-2418(200103)18:2<141::AID-RSA1002>3.0.CO;2-W

    4. The Boyer–Moore–Horspool heuristic with Markovian input (pages 153–163)

      R. T. Smythe

      Article first published online: 26 JAN 2001 | DOI: 10.1002/1098-2418(200103)18:2<153::AID-RSA1003>3.0.CO;2-O

    5. A phase transition phenomenon in a random directed acyclic graph (pages 164–184)

      B. Pittel and R. Tungol

      Article first published online: 26 JAN 2001 | DOI: 10.1002/1098-2418(200103)18:2<164::AID-RSA1004>3.0.CO;2-H

    6. On the effect of selection in genetic algorithms (pages 185–200)

      Christian Mazza and Didier Piau

      Article first published online: 26 JAN 2001 | DOI: 10.1002/1098-2418(200103)18:2<185::AID-RSA1005>3.0.CO;2-7

SEARCH

SEARCH BY CITATION