Algorithms for maximum internal spanning tree problem for some graph classes.
Gopika SharmaArti PandeyMichael C. WigalPublished in: J. Comb. Optim. (2022)
Keyphrases
- graph theory
- optimization problems
- maximum flow
- computational complexity
- theoretical analysis
- data clustering
- evolutionary algorithm
- significant improvement
- computationally efficient
- graph representation
- objective function
- computational cost
- combinatorial optimization
- web graph
- maximal cliques
- partitioning algorithm