Faster Edge-Path Bundling through Graph Spanners.
Markus WallingerDaniel ArchambaultDavid AuberMartin NöllenburgJaakko PeltonenPublished in: Comput. Graph. Forum (2023)
Keyphrases
- weighted graph
- edge weights
- disjoint paths
- strongly connected
- shortest path
- undirected graph
- graph structure
- solution path
- vertex set
- hamiltonian path
- bipartite graph
- structured data
- graph model
- directed graph
- spanning tree
- stable set
- graph theoretic
- minimum cost
- shortest path problem
- minimum spanning tree
- graph mining
- graph based algorithm
- graph clustering
- approximation algorithms
- graph theory
- endpoints
- binary images
- graph structures
- memory efficient
- random graphs
- path length
- connected components
- graph representation
- random walk
- directed acyclic graph