Networks

Cover image for Networks

October 2003

Volume 42, Issue 3

Pages 123–180

    1. Broadcasting in generalized chordal rings (pages 123–134)

      F. Comellas and P. Hell

      Version of Record online: 21 AUG 2003 | DOI: 10.1002/net.10088

    2. You have free access to this content
    3. Reoptimizing the traveling salesman problem (pages 154–159)

      Claudia Archetti, Luca Bertazzi and M. Grazia Speranza

      Version of Record online: 21 AUG 2003 | DOI: 10.1002/net.10091

    4. A linear algorithm for compact box-drawings of trees (pages 160–164)

      Masud Hasan, Md. Saidur Rahman and Takao Nishizeki

      Version of Record online: 21 AUG 2003 | DOI: 10.1002/net.10092

    5. The linear arrangement problem on recursively constructed graphs (pages 165–168)

      S. B. Horton, T. Easton and R. Gary Parker

      Version of Record online: 21 AUG 2003 | DOI: 10.1002/net.10093

    6. Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory (pages 169–180)

      Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc and Yannis C. Stamatiou

      Version of Record online: 28 AUG 2003 | DOI: 10.1002/net.10094

SEARCH

SEARCH BY CITATION