Reducing the maximum degree of a graph by deleting edges.
Peter BorgKurt FenechPublished in: Australas. J Comb. (2019)
Keyphrases
- directed graph
- weighted graph
- spanning tree
- undirected graph
- directed acyclic graph
- random walk
- edge weights
- nodes of a graph
- vertex set
- graph representation
- random graphs
- degree distribution
- massive graphs
- graph structure
- spectral embedding
- structured data
- graph theory
- graph model
- directed edges
- connected components
- real world graphs
- dependency graph
- graph search
- bipartite graph
- maximum matching
- np complete
- graph construction
- segmented regions
- graph theoretic
- approximation algorithms
- graph databases
- link analysis