Arboricity, h-Index, and Dynamic Algorithms
Data Structures and Algorithms
2014-08-18 v1
Abstract
In this paper we present a modification of a technique by Chiba and Nishizeki [Chiba and Nishizeki: Arboricity and Subgraph Listing Algorithms, SIAM J. Comput. 14(1), pp. 210--223 (1985)]. Based on it, we design a data structure suitable for dynamic graph algorithms. We employ the data structure to formulate new algorithms for several problems, including counting subgraphs of four vertices, recognition of diamond-free graphs, cop-win graphs and strongly chordal graphs, among others. We improve the time complexity for graphs with low arboricity or h-index.
Keywords
Cite
@article{arxiv.1005.2211,
title = {Arboricity, h-Index, and Dynamic Algorithms},
author = {Min Chih Lin and Francisco J. Soulignac and Jayme L. Szwarcfiter},
journal= {arXiv preprint arXiv:1005.2211},
year = {2014}
}
Comments
19 pages, no figures