The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as König-Egerváry graphs. These graphs have been studied extensively from a graph theoretic point of view. In this paper, we introduce and study the al
- PDF / 17,331,521 Bytes
- 945 Pages / 430.15 x 660.926 pts Page_size
- 83 Downloads / 251 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
4835
Takeshi Tokuyama (Ed.)
Algorithms and Computation 18th International Symposium, ISAAC 2007 Sendai, Japan, December 17-19, 2007 Proceedings
13
Volume Editor Takeshi Tokuyama Tohoku University Graduate School of Information Sciences Sendai, 980-8579, Japan E-mail: [email protected]
Library of Congress Control Number: 2007940402 CR Subject Classification (1998): F.2, C.2, G.2-3, I.3.5, C.2.4, E.5 LNCS Sublibrary: SL 1 – Theoretical Computer Science and General Issues ISSN ISBN-10 ISBN-13
0302-9743 3-540-77118-2 Springer Berlin Heidelberg New York 978-3-540-77118-0 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: 12200528 06/3180 543210
Preface
ISAAC 2007, the 18th International Symposium on Algorithms and Computation took place in Sendai, Japan, December 17-19, 2007. In the past, it was held in Tokyo (1990), Taipei (1991), Nagoya (1992), Hong Kong (1993), Beijing (1994), Cairns (1995), Osaka (1996), Singapore (1997), Daejeon (1998), Chennai (1999), Taipei (2000), Christchurch (2001), Vancouver (2002), Kyoto (2003), Hong Kong (2004), Hainan (2005), and Kolkata(2006). The symposium provided a forum for researchers working in algorithms and the theory of computation from all over the world. In response to our call for papers we received 220 submissions from 40 countries. The task of selecting the papers in this volume was done by our Program Committee
Data Loading...
