UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

Nested hierarchies in planar graphs

Song, W-M; Di Matteo, T; Aste, T; (2011) Nested hierarchies in planar graphs. Discrete Applied Mathematics , 159 (17) 2135 - 2146. 10.1016/j.dam.2011.07.018.

Full text not available from this repository.

Abstract

We construct a partial order relation which acts on the set of 3-cliques of a maximal planar graph G and defines a unique hierarchy. We demonstrate that G is the union of a set of special subgraphs, named 'bubbles', that are themselves maximal planar graphs. The graph G is retrieved by connecting these bubbles in a tree structure where neighboring bubbles are joined together by a 3-clique. Bubbles naturally provide the subdivision of G into communities and the tree structure defines the hierarchical relations between these communities. © 2011 Elsevier B.V. All rights reserved.

Type:Article
Title:Nested hierarchies in planar graphs
DOI:10.1016/j.dam.2011.07.018
UCL classification:UCL > School of BEAMS > Faculty of Engineering Science > Computer Science

Archive Staff Only: edit this record