Dominating Sets

A subset of the vertices of a graph is a dominating set if every vertex not in the subset is adjacent to at least one vertex in this subset. Dominating sets are widely used for clustering and routing in ad hoc wireless networks. In this chapter, we descri

  • PDF / 3,830,770 Bytes
  • 327 Pages / 441 x 666 pts Page_size
  • 113 Downloads / 236 Views

DOWNLOAD

REPORT


For further volumes: www.springer.com/series/4198

The Computer Communications and Networks series is a range of textbooks, monographs and handbooks. It sets out to provide students, researchers and non-specialists alike with a sure grounding in current knowledge, together with comprehensible access to the latest developments in computer communications and networking. Emphasis is placed on clear and explanatory styles that support a tutorial approach, so that even the most complex of topics is presented in a lucid and intelligible manner.

K. Erciyes

Distributed Graph Algorithms for Computer Networks

K. Erciyes Computer Engineering Department Izmir University Uckuyular, Izmir, Turkey Series Editor A.J. Sammes Centre for Forensic Computing Cranfield University Shrivenham campus Swindon, UK

ISSN 1617-7975 Computer Communications and Networks ISBN 978-1-4471-5172-2 ISBN 978-1-4471-5173-9 (eBook) DOI 10.1007/978-1-4471-5173-9 Springer London Heidelberg New York Dordrecht Library of Congress Control Number: 2013938954 © Springer-Verlag London 2013 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. Exempted from this legal reservation are brief excerpts in connection with reviews or scholarly analysis or material supplied specifically for the purpose of being entered and executed on a computer system, for exclusive use by the purchaser of the work. Duplication of this publication or parts thereof is permitted only under the provisions of the Copyright Law of the Publisher’s location, in its current version, and permission for use must always be obtained from Springer. Permissions for use may be obtained through RightsLink at the Copyright Clearance Center. Violations are liable to prosecution under the respective Copyright Law. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. While the advice and information in this book are believed to be true and accurate at the date of publication, neither the authors nor the editors nor the publisher can accept any legal responsibility for any errors or omissions that may be made. The publisher makes no warranty, express or implied, with respect to the material contained herein. Printed on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com)

To the memories of Necdet Doˇganata and Selçuk Erciyes, and all who believe in education

Preface

Distributed systems consisting of a number of autonomous computing elem