Finding a maximum-genus graph imbedding.
Merrick L. FurstJonathan L. GrossLyle A. McGeochPublished in: J. ACM (1988)
Keyphrases
- random walk
- graph model
- graph structure
- strongly connected
- directed graph
- selecting a small number
- stable set
- maximum clique
- graph representation
- bipartite graph
- directed acyclic graph
- structured data
- graph partitioning
- graphical models
- minimum spanning tree
- information extraction
- special case
- social networks
- data mining