Making an Arbitrary Filled Graph Minimal by Removing Fill Edges.
Jean R. S. BlairPinar HeggernesJan Arne TellePublished in: SWAT (1996)
Keyphrases
- directed graph
- weighted graph
- undirected graph
- spanning tree
- directed acyclic graph
- edge weights
- graph representation
- graph theory
- shortest path
- graph model
- graph structure
- nodes of a graph
- random walk
- graph theoretic
- real world graphs
- spectral embedding
- edge information
- graph matching
- structured data
- graph mining
- graph data
- vertex set
- stable set
- connected components
- massive graphs
- directed edges
- social networks
- bipartite graph
- graph search
- maximum matching
- d objects