Clique-Width: Harnessing the Power of Atoms

Many NP -complete graph problems are polynomial-time solvable on graph classes of bounded clique-width. Several of these problems are polynomial-time solvable on a hereditary graph class \(\mathcal{G}\) if they are so on the atoms (graphs with no clique c

  • PDF / 11,235,858 Bytes
  • 430 Pages / 439.37 x 666.142 pts Page_size
  • 25 Downloads / 235 Views

DOWNLOAD

REPORT


ARCoSS

Isolde Adler Haiko Müller (Eds.)

Graph-Theoretic Concepts in Computer Science 46th International Workshop, WG 2020 Leeds, UK, June 24–26, 2020 Revised Selected Papers

Lecture Notes in Computer Science

12301

Founding Editors Gerhard Goos, Germany Juris Hartmanis, USA

Editorial Board Members Elisa Bertino, USA Wen Gao, China Bernhard Steffen , Germany

Gerhard Woeginger , Germany Moti Yung, USA

Advanced Research in Computing and Software Science Subline of Lecture Notes in Computer Science Subline Series Editors Giorgio Ausiello, University of Rome ‘La Sapienza’, Italy Vladimiro Sassone, University of Southampton, UK

Subline Advisory Board Susanne Albers, TU Munich, Germany Benjamin C. Pierce, University of Pennsylvania, USA Bernhard Steffen , University of Dortmund, Germany Deng Xiaotie, Peking University, Beijing, China Jeannette M. Wing, Microsoft Research, Redmond, WA, USA

More information about this series at http://www.springer.com/series/7407

Isolde Adler Haiko Müller (Eds.) •

Graph-Theoretic Concepts in Computer Science 46th International Workshop, WG 2020 Leeds, UK, June 24–26, 2020 Revised Selected Papers

123

Editors Isolde Adler University of Leeds Leeds, UK

Haiko Müller University of Leeds Leeds, UK

ISSN 0302-9743 ISSN 1611-3349 (electronic) Lecture Notes in Computer Science ISBN 978-3-030-60439-4 ISBN 978-3-030-60440-0 (eBook) https://doi.org/10.1007/978-3-030-60440-0 LNCS Sublibrary: SL1 – Theoretical Computer Science and General Issues © Springer Nature Switzerland AG 2020 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. 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. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, expressed or implied, with respect to the material contained herein or for any errors or omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in published maps and institutional affiliations. This Springer imprint is published by the registered company Springer Nature Switzerland AG The registered company address is: Gewerbestrasse 11, 6330 Cham, Switzerland

Preface

This volume contains the 32 papers presented at the 46th International Workshop on Graph-Theoretic Concepts in Computer Science (

Data Loading...