Rank Reduction of Oriented Graphs by Vertex and Edge Deletions.
Syed Mohammad MeesumSaket SaurabhPublished in: Algorithmica (2018)
Keyphrases
- undirected graph
- edge weights
- vertex set
- weighted graph
- directed graph
- spanning tree
- minimum weight
- strongly connected
- labeled graphs
- approximation algorithms
- graph structure
- directed acyclic graph
- attributed graphs
- random graphs
- minimum cost
- connected components
- complex networks
- minimum spanning trees
- bipartite graph
- edge detection
- graph model
- web graph
- hamiltonian cycle
- early vision
- neural network
- graph databases
- similarity measure
- graph matching
- graph mining
- adjacency matrix
- rank aggregation
- reduction method
- graph data
- edge information
- graph theoretic