Complexity Results for the Proper Disconnection of Graphs
For an edge-colored graph G, a set F of edges of G is called a proper edge-cut if F is an edge-cut of G and any pair of adjacent edges in F are assigned by different colors. An edge-colored graph is called proper disconnected if for each pair of distinct
- PDF / 3,696,140 Bytes
- 154 Pages / 439.37 x 666.142 pts Page_size
- 89 Downloads / 181 Views
Minming Li (Ed.)
Frontiers in Algorithmics 14th International Workshop, FAW 2020 Haikou, China, October 19–21, 2020 Proceedings
Lecture Notes in Computer Science Founding Editors Gerhard Goos Karlsruhe Institute of Technology, Karlsruhe, Germany Juris Hartmanis Cornell University, Ithaca, NY, USA
Editorial Board Members Elisa Bertino Purdue University, West Lafayette, IN, USA Wen Gao Peking University, Beijing, China Bernhard Steffen TU Dortmund University, Dortmund, Germany Gerhard Woeginger RWTH Aachen, Aachen, Germany Moti Yung Columbia University, New York, NY, USA
12340
More information about this series at http://www.springer.com/series/7407
Minming Li (Ed.)
Frontiers in Algorithmics 14th International Workshop, FAW 2020 Haikou, China, October 19–21, 2020 Proceedings
123
Editor Minming Li City University of Hong Kong Hong Kong, China
ISSN 0302-9743 ISSN 1611-3349 (electronic) Lecture Notes in Computer Science ISBN 978-3-030-59900-3 ISBN 978-3-030-59901-0 (eBook) https://doi.org/10.1007/978-3-030-59901-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 papers presented at the 14th International Frontiers of Algorithmics Workshop (FAW 2020), held during October 19–21, 2020, at Hainan University in Haikou, China. Due to COVID-19, the whole conference was conducted online. In order to conduct a real-time, interactive online conference, we arranged three half-day programs where each day started with a keynote talk, followed by one session consisting of four talks. The workshop provides a forum on current trends of research in algorithms, di
Data Loading...
