\mathbb F-Rank-Width of (Edge-Colored) Graphs.
Mamadou Moustapha KantéMichaël RaoPublished in: CAI (2011)
Keyphrases
- vertex set
- weighted graph
- undirected graph
- graph theoretic
- edge detection
- spanning tree
- edge weights
- series parallel
- graph matching
- graph theory
- pattern recognition
- minimum spanning trees
- multiple scales
- graph mining
- graph structure
- edge detector
- directed graph
- data sets
- edge information
- data objects
- random walk
- adjacency graph
- densely connected