# 1 Control Flow Graphs

Note: This is just a subset of GraphViz, so we link to that dataset instead. Origin Notes: 14 graphs from the GraphViz test suite collected by Gansner and Hu to evaluate their PRISM algorithm in ”https://dx.doi.org/10.7155/jgaa.00198”. graph features handled: Large Graph features in papers: large Size: 14 graphs, from 36 to 1463 nodes Child collections: Graphviz Examples (Graphviz%20Examples%20e90aec42f02c4e8b8a6b8727fe2f86ae.md) Appeared in years: 2016 Type of Collection: Subset of other collection is it stored properly?: No must be analyzed: No In repo?: Yes Related to Literature - Algorithm (1) (Dataset tag relations): Node Overlap Removal by Growing a Tree (https://www.notion.so/Node-Overlap-Removal-by-Growing-a-Tree-534753c850d64167892bde314403e2d6?pvs=21) cleaned format?: Yes duplicate?: Yes link works?: No Added in paper: No Page id: af079f199a2c402d8633f6d41101934b unavailable/skip: No Cleaned ALL data: No first look: No Related to Literature - Algorithm (Dataset tag relations) 1: Node Overlap Removal by Growing a Tree (../Benchmark%20sets%200cc6b5e454304aec98f3b59b1a720476/Literature%20ad87f14e7097454fb2f784e2c8a2797a/Literature%20-%20Algorithm%2012e01bfc60a84007aa7d2d34293e123d/Node%20Overlap%20Removal%20by%20Growing%20a%20Tree%20c69ee6ac8232493b9f8d26ed56235a6b.md)

# 2 Body

### Descriptions from Literature

From “Node Overlap Removal by Growing a Tree”:

> Our data includes the same set of graphs that was used by the authors of PRISM to compare it with other algorithms [6]. The set is available in the Graphviz open source package.

### Example Figures

From “Node Overlap Removal by Growing a Tree”:

Untitled

=== Stop Rendering===

Untitled

Untitled

Untitled