Layered graphs: a class that admits polynomial time solutions for some hard problems.
Bhadrachalam ChitturiPublished in: CoRR (2017)
Keyphrases
- hard problems
- hyper heuristics
- subgraph isomorphism
- special case
- graph matching
- phase transition
- evolutionary algorithm
- planar graphs
- graph isomorphism
- benchmark problems
- polynomial size
- random instances
- timetabling problem
- genetic programming
- computational complexity
- optimal solution
- edit distance
- difficult problems
- greedy algorithm
- metaheuristic
- computational intelligence
- worst case
- cost function