Accelerating All 5-Vertex Subgraphs Counting Using GPUs
The subgraph counting problem is the problem of counting the number of occurrences of graph patterns in the target graph and is widely used as a fundamental technique for network analyses in different domains. The computational cost of subgraph counting g
- PDF / 32,503,598 Bytes
- 469 Pages / 439.37 x 666.142 pts Page_size
- 53 Downloads / 162 Views
Sven Hartmann · Josef Küng · Gabriele Kotsis · A Min Tjoa · Ismail Khalil (Eds.)
Database and Expert Systems Applications 31st International Conference, DEXA 2020 Bratislava, Czech Republic, September 14–17, 2020 Proceedings, Part I
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
12391
More information about this series at http://www.springer.com/series/7409
Sven Hartmann Josef Küng Gabriele Kotsis A Min Tjoa Ismail Khalil (Eds.) •
•
• •
Database and Expert Systems Applications 31st International Conference, DEXA 2020 Bratislava, Czech Republic, September 14–17, 2020 Proceedings, Part I
123
Editors Sven Hartmann Clausthal University of Technology Clausthal-Zellerfeld, Germany Gabriele Kotsis Johannes Kepler University of Linz Linz, Austria Ismail Khalil Johannes Kepler University of Linz Linz, Austria
Josef Küng Johannes Kepler University of Linz Linz, Austria A Min Tjoa IFS Vienna University of Technology Vienna, Wien, Austria
ISSN 0302-9743 ISSN 1611-3349 (electronic) Lecture Notes in Computer Science ISBN 978-3-030-59002-4 ISBN 978-3-030-59003-1 (eBook) https://doi.org/10.1007/978-3-030-59003-1 LNCS Sublibrary: SL3 – Information Systems and Applications, incl. Internet/Web, and HCI © 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 vo
