Bounding Dilation and Edge-Congestion of Separator-Based Graph Embeddings into Grids.
Akira MatsubayashiPublished in: CANDAR (2015)
Keyphrases
- weighted graph
- undirected graph
- disjoint paths
- graph theory
- edge weights
- directed graph
- random walk
- graph representation
- binary images
- vertex set
- connected components
- edge information
- mathematical morphology
- graph partitioning
- graph model
- directed acyclic graph
- upper bound
- graph structure
- image processing
- edge detection
- vector space
- structured data
- bipartite graph
- morphological filtering
- strongly connected
- graph theoretic
- morphological operations
- graph matching
- high dimensional data
- scale space
- morphological filters
- ip networks
- congestion control
- graph based algorithm
- air traffic
- data objects
- approximation algorithms