Detecting critical nodes in sparse graphs.
Ashwin ArulselvanClayton W. CommanderLily ElefteriadouPanos M. PardalosPublished in: Comput. Oper. Res. (2009)
Keyphrases
- directed graph
- graph structure
- graph structures
- undirected graph
- densely connected
- weighted graph
- adjacency matrix
- graph matching
- directed acyclic
- connected graphs
- real world networks
- average degree
- random graphs
- gaussian graphical models
- sparse data
- high dimensional
- fully connected
- small world networks
- small world
- spanning tree
- graph theory
- shortest path
- edge weights
- real world graphs
- network structure
- finding the shortest path
- planar graphs
- nodes of a graph
- attributed graphs
- graph clustering
- graph model
- sparse coding
- structured data
- sparse representation
- strongly connected
- labeled trees
- graph partitioning
- graph mining
- random walk
- image classification