Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs.
A. Karim Abu-AffashPaz CarmiAnil MaheshwariPat MorinMichiel H. M. SmidShakhar SmorodinskyPublished in: SoCG (2018)
Keyphrases
- graph mining
- graph databases
- subgraph matching
- graph classification
- graph properties
- subgraph isomorphism
- labeled graphs
- graph data
- frequent subgraphs
- connected subgraphs
- query graph
- graph theoretic
- bounded treewidth
- maximum distance
- subgraph mining
- frequent subgraph mining
- dense subgraphs
- graph matching
- graph structure
- maximum clique
- edge weights
- graph search
- np complete
- average degree
- graph patterns
- graph model
- maximum number
- np hard
- search algorithm
- bounded degree
- structured data
- bipartite graph
- community discovery
- weighted graph