Presentation is loading. Please wait.

Presentation is loading. Please wait.

Graph Abstraction Through Centrality Erosion and k-Clique Minimization

Similar presentations


Presentation on theme: "Graph Abstraction Through Centrality Erosion and k-Clique Minimization"— Presentation transcript:

1 Graph Abstraction Through Centrality Erosion and k-Clique Minimization
Drew Harry Dan Lindquist

2 Nasty Graph #1

3 Nasty Graph #2

4 Vertex Centrality

5 Finding Zero Centrality Vertices

6 Finding Zero Centrality Vertices

7 Finding Zero Centrality Vertices

8 Vertex Centrality

9 Centrality Erosion

10 Centrality Erosion

11 Centrality Erosion

12 Centrality Erosion

13 Centrality Erosion Final Result

14 Centrality Erosion on Tree Graph

15 k-Cliques Discovery

16 k-Cliques Discovery

17 k-Cliques Discovery

18 k-Cliques Discovery

19 k-Cliques Discovery

20 k-Cliques Discovery

21 k-Cliques Discovery Heuristic

22 k-Cliques Discovery Heuristic

23 k-Cliques Discovery Heuristic

24 k-Cliques Discovery Heuristic

25 k-Cliques Discovery Heuristic

26 k-Cliques Discovery Heuristic

27 k-Cliques Simplification

28 k-Cliques Simplification

29 Centrality Reduction

30 Centrality Reduction

31 Centrality Reduction

32 Centrality Reduction

33 V: 62; E: 144

34 V: 37; E: 66

35 V: 25; E: 41

36 North American Airports - Original
V: 332; E: 2126

37 North American Airports - k-Cliques
V: 232; E: 489

38 North American Airports - Halo Reduced
V: 84; E: 245


Download ppt "Graph Abstraction Through Centrality Erosion and k-Clique Minimization"

Similar presentations


Ads by Google