Old Web
English
Sign In
Acemap
>
Paper
>
META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
2020
Ali Kaveh
K. Biabani Hamedani
Keywords:
Bipartite graph
meta heuristic
Combinatorics
Construction management
Computer science
Graph
Optimal design
Correction
Source
Cite
Save
Machine Reading By IdeaReader
15
References
0
Citations
NaN
KQI
[]