BC Tree-Based Proxy Graphs for Visualization of Big Graphs

Nguyen, Quan; Meidiana, Amyra; Li, Jiaxi; Eades, Peter

doi:10.1109/pacificvis.2018.00011

“…1a. Observe, for instance, how the edges (5,6) and (6, 7) that have weight 5 and 6, respectively, are below the edge (5, 7) that has weight 11 and how such edge is below the edge (3, 7) whose weight is 12. We have the following preliminary observation.…”

Section: Max-constrained Book-embeddingsmentioning

confidence: 99%

“…Several recent contributions focus on algorithms that produce drawings where either the graph is only partially represented or it is schematically visualized. Examples of the first type are proxy drawings [6,12], where a graph that is too large to be fully visualized is represented by the drawing of a much smaller proxy graph that preserves the main features of the original graph. Examples of the second type are graph thumbnails [15], where each connected component of a graph is represented by a disk and biconnected components are represented by disks contained into the disk of the connected component they belong to.…”

Section: Introductionmentioning

confidence: 99%

Schematic Representation of Biconnected Graphs

Battista

¹

,

Frati

²

,

Patrignani

³

et al. 2020

Lecture Notes in Computer Science

3

0

View full text Add to dashboard Cite

Suppose that a biconnected graph is given, consisting of a large component plus several other smaller components, each separated from the main component by a separation pair. We investigate the existence and the computation time of schematic representations of the structure of such a graph where the main component is drawn as a disk, the vertices that take part in separation pairs are points on the boundary of the disk, and the small components are placed outside the disk and are represented as non-intersecting lunes connecting their separation pairs. We consider several drawing conventions for such schematic representations, according to different ways to account for the size of the small components. We map the problem of testing for the existence of such representations to the one of testing for the existence of suitably constrained 1-page book-embeddings and propose several polynomial-time algorithms.

show abstract

“…Mutual interactions within the BCC can cover long-range information with low noise. Thus, BCC is widely used to effectively capture the global structural information of a graph in various tasks such as weighted vertex cover or minimum cost flow [16,35,15]. Another promising candidate is a set of cliques.…”

Section: Introductionmentioning

confidence: 99%

SPGP: Structure Prototype Guided Graph Pooling

Lee¹,

Lee²,

Piao³

et al. 2022

Preprint

0

View full text Add to dashboard Cite

While graph neural networks (GNNs) have been successful for node classification tasks and link prediction tasks in graph, learning graph-level representations still remains a challenge. For the graph-level representation, it is important to learn both representation of neighboring nodes, i.e., aggregation, and graph structural information. A number of graph pooling methods have been developed for this goal. However, most of the existing pooling methods utilize k-hop neighborhood without considering explicit structural information in a graph. In this paper, we propose Structure Prototype Guided Pooling (SPGP) that utilizes prior graph structures to overcome the limitation. SPGP formulates graph structures as learnable prototype vectors and computes the affinity between nodes and prototype vectors. This leads to a novel node scoring scheme that prioritizes informative nodes while encapsulating the useful structures of the graph. Our experimental results show that SPGP outperforms state-of-the-art graph pooling methods on graph classification benchmark datasets in both accuracy and scalability.Preprint. Under review.

show abstract

“…Several recent contributions focus on algorithms that produce drawings where either the graph is only partially represented or it is schematically visualized. Examples of the first type are proxy drawings [7,13], where a graph that is too large to be fully visualized is represented by the drawing of a much smaller proxy graph that preserves the main features of the original graph. Examples of the second type are graph thumbnails [16], where each connected component of a graph is represented by a disk and biconnected components are represented by disks contained into the disk of the connected component they belong to.…”

Section: Introductionmentioning

confidence: 99%

Schematic Representation of Large Biconnected Graphs

Battista¹,

Frati²,

Patrignani³

et al. 2020

Preprint

0

View full text Add to dashboard Cite

Suppose that a biconnected graph is given, consisting of a large component plus several other smaller components, each separated from the main component by a separation pair. We investigate the existence and the computation time of schematic representations of the structure of such a graph where the main component is drawn as a disk, the vertices that take part in separation pairs are points on the boundary of the disk, and the small components are placed outside the disk and are represented as non-intersecting lunes connecting their separation pairs. We consider several drawing conventions for such schematic representations, according to different ways to account for the size of the small components. We map the problem of testing for the existence of such representations to the one of testing for the existence of suitably constrained 1-page book-embeddings and propose several polynomial-time and pseudo-polynomial-time algorithms.

show abstract

BC Tree-Based Proxy Graphs for Visualization of Big Graphs

Cited by 11 publications

References 17 publications

Schematic Representation of Biconnected Graphs

Schematic Representation of Biconnected Graphs

SPGP: Structure Prototype Guided Graph Pooling

Schematic Representation of Large Biconnected Graphs

Contact Info

Product

Resources

About