<p>This book is considered the first extended survey on algorithms and techniques for efficient cohesive subgraph computation. With rapid development of information technology, huge volumes of graph data are accumulated. An availability of rich graph data not only brings great opportunities for real
Algorithms for Graph Similarity and Subgraph Matching
β Scribed by Danai Koutra, Ankur Parikh, Aaditya Ramdas, Aaditya Ramdas
- Tongue
- English
- Leaves
- 50
- Category
- Library
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A revised and expanded advanced-undergraduate/graduate text (first ed., 1978) about optimization algorithms for problems that can be formulated on graphs and networks. This edition provides many new applications and algorithms while maintaining the classic foundations on which contemporary algorithm
<p><p>This book constitutes the proceedings of the 15th International Workshop on Algorithms and Models for the Web Graph, WAW 2018, held in Moscow, Russia in May 2018.</p><p>The 11 full papers presented in this volume were carefully reviewed and selected from various submissions. The papers focus o
In this work we plan to revise the main techniques for enumeration algorithms and to show four examples of enumeration algorithms that can be applied to efficiently deal with some biological problems modelled by using biological networks: enumerating central and peripheral nodes of a network, enumer