Name
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.dam.2011.07.018 | Discrete Applied Mathematics |
Keywords | Field | DocType |
special subgraphs,partial order relation,tree structure,neighboring bubble,planar graph,maximal planar graph,graph g,hierarchical relation,nested hierarchy,unique hierarchy,bubble,partial order,hierarchy,community | Discrete mathematics,Graph,Combinatorics,Computer science,Subdivision,Tree structure,Complex network,Pathwidth,Hierarchy,Planar graph | Journal |
Volume | Issue | ISSN |
159 | 17 | Journal of Discrete Applied Mathematics, 159 (2011) 2135-2146 |
Citations | PageRank | References |
3 | 0.46 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Won-Min Song | 1 | 3 | 0.46 |
| T. Di Matteo | 2 | 15 | 1.23 |
| Tomaso Aste | 3 | 57 | 11.62 |