Enumerating Maximal Isolated Cliques Based on Vertex-Dependent Connection Lower Bound.
Yoshiaki OkuboMakoto HaraguchiEtsuji TomitaPublished in: MLDM (2016)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- objective function
- lower bounding
- np hard
- optimal solution
- lower and upper bounds
- worst case
- upper and lower bounds
- attributed graphs
- linear programming relaxation
- neural network
- polynomial approximation
- minimum weight
- constant factor
- sufficiently accurate
- functional modules
- vc dimension
- sample complexity
- community structure
- random variables