Heuristically determining cliques of given cardinality and with minimal cost within weighted complete graphs.
Helmuth SpäthPublished in: Z. Oper. Research (1985)
Keyphrases
- minimal cost
- weighted graph
- maximal cliques
- graph structure
- feasible solution
- endpoints
- edit operations
- network flow problem
- network design problem
- graph model
- graph theory
- objective function
- edge weights
- directed graph
- association graph
- graph partitioning
- maximum clique
- subgraph isomorphism
- graph mining
- optimal solution