D. Eppstein, Arboricity and bipartite subgraph listing algorithms, Inform. Process. Lett. 51 (1994) 207-211.D. Eppstein. Arboricity and bipartite subgraph listing algorithms. Infor- mation Processing Letters, 51
The data structure employs a technique first described by Chiba and Nishizeki [Chiba, Nishizeki, Arboricity and subgraph listing algorithms, SIAM J. Comput. 14 (1) (1985) 210–223], and relies on the arboricity of graphs. Using the proposed data structure, we describe several dynamic ...
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 da...