Cartesian Graph Factorization at Logarithmic Cost per Edge.
Franz AurenhammerJohann HagauerWilfried ImrichPublished in: Comput. Complex. (1992)
Keyphrases
- weighted graph
- undirected graph
- edge weights
- edge detection
- pairwise
- worst case
- disjoint paths
- bipartite graph
- graph theory
- structured data
- kronecker product
- path length
- graph representation
- directed graph
- bayesian networks
- vertex set
- expected cost
- graph structure
- high cost
- graph matching
- graph partitioning
- matrix factorization
- graph model
- spanning tree
- connected components
- minimum spanning tree
- strongly connected
- directed acyclic graph
- min sum
- random walk
- low rank