Self-Organized Polynomial-Time Coordination Graphs.
Qianlan YangWeijun DongZhizhou RenJianhao WangTonghan WangChongjie ZhangPublished in: CoRR (2021)
Keyphrases
- graph isomorphism
- polynomial time complexity
- small world
- special case
- multi agent systems
- bounded treewidth
- complex systems
- graph theory
- directed graph
- planar graphs
- np complete
- approximation algorithms
- worst case
- data sets
- graph databases
- random graphs
- cooperative
- graph theoretic
- information exchange
- series parallel
- approximation ratio
- graph partitioning
- complex structures
- graph mining
- graph matching
- multi agent
- neural network
- subgraph isomorphism
- graph structure
- computational complexity
- neural gas