Vertex Pursuit Games in Stochastic Network Models
Random graphs with given expected degrees G(w) were introduced by Chung and Lu so as to extend the theory of classical G(n,p) random graphs to include random power law graphs. We investigate asymptotic results for the game of Cops and Robber played on G(w
- PDF / 3,415,972 Bytes
- 157 Pages / 430.15 x 660.926 pts Page_size
- 47 Downloads / 176 Views
Editorial Board David Hutchison Lancaster University, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Friedemann Mattern ETH Zurich, Switzerland John C. Mitchell Stanford University, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel Oscar Nierstrasz University of Bern, Switzerland C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen University of Dortmund, Germany Madhu Sudan Massachusetts Institute of Technology, MA, USA Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Moshe Y. Vardi Rice University, Houston, TX, USA Gerhard Weikum Max-Planck Institute of Computer Science, Saarbruecken, Germany
4852
Jeannette Janssen Paweł Prałat (Eds.)
Combinatorial and Algorithmic Aspects of Networking 4th Workshop, CAAN 2007 Halifax, Canada, August 14, 2007 Revised Papers
13
Volume Editors Jeannette Janssen Paweł Prałat Dalhousie University Department of Mathematics and Statistics Halifax, NS, B3H 3J5, Canada E-mail: {janssen,pralat}@mathstat.dal.ca
Library of Congress Control Number: 2007941336 CR Subject Classification (1998): F.1.1, F.2.1-2, C.2, G.2.1-2, E.1 LNCS Sublibrary: SL 5 – Computer Communication Networks and Telecommunications ISSN ISBN-10 ISBN-13
0302-9743 3-540-77293-6 Springer Berlin Heidelberg New York 978-3-540-77293-4 Springer Berlin Heidelberg New York
This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. Springer is a part of Springer Science+Business Media springer.com © Springer-Verlag Berlin Heidelberg 2007 Printed in Germany Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, India Printed on acid-free paper SPIN: 12204793 06/3180 543210
Preface
The advent of the Internet has opened up a wealth of applications, but also given rise to a host of new problems. Many of those problems have led to exciting new research directions in mathematics and theoretical computer science, especially in the areas of combinatorics and algorithms. The Fourth Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN 2007) was organized to be a place where the latest research developments on all aspects of networking could be presented. The topics covered were diverse, with talks on strategies for searching in networks, for cleaning networks of unwanted intruders, on different routing strategies, and on sc
Data Loading...
