Reducing the maximum degree of a graph by deleting vertices.
Peter BorgKurt FenechPublished in: Australas. J Comb. (2017)
Keyphrases
- random graphs
- weighted graph
- labeled graphs
- adjacency matrix
- hamiltonian cycle
- undirected graph
- graph theoretic
- directed edges
- planar graphs
- edge weights
- graph matching
- directed graph
- maximum matching
- bipartite graph
- structured data
- graph theory
- random walk
- graph model
- average degree
- total weight
- vertex set
- connected subgraphs
- maximal cliques
- graph representation
- minimum weight
- attributed graphs
- degree distribution
- shortest path
- query graph
- stable set
- maximum cardinality
- graph partitioning
- bayesian networks
- dependency graph
- power law
- graph mining