Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges.
Peter DamaschkePublished in: IWOCA (2020)
Keyphrases
- directed graph
- weighted graph
- spanning tree
- undirected graph
- edge weights
- directed acyclic graph
- nodes of a graph
- random walk
- spectral embedding
- graph structure
- gaussian graphical models
- graph representation
- real world graphs
- connected components
- densely connected
- bipartite graph
- image structure
- vertex set
- directed edges
- maximum matching
- sparse data
- graph theoretic
- edge information
- graph partitioning
- graph matching
- structured data
- sparse representation
- feature space
- weighted sum
- elastic net
- graph model
- graph theory
- sparse coding
- strongly connected components
- massive graphs
- high dimensional
- pairwise