Declawing a graph: polyhedra and Branch-and-Cut algorithms.
Felipe C. FragosoGilberto Farias de Sousa FilhoFábio ProttiPublished in: J. Comb. Optim. (2021)
Keyphrases
- graph theory
- random walk
- computational complexity
- computational cost
- theoretical analysis
- computationally efficient
- partitioning algorithm
- minimum spanning tree
- graph data
- graph representation
- bipartite graph
- directed graph
- orders of magnitude
- data mining
- worst case
- special case
- significant improvement
- data structure
- learning algorithm
- genetic algorithm