Self-Organized Polynomial-Time Coordination Graphs.
Qianlan YangWeijun DongZhizhou RenJianhao WangTonghan WangChongjie ZhangPublished in: ICML (2022)
Keyphrases
- graph isomorphism
- bounded treewidth
- special case
- small world
- polynomial time complexity
- cooperative
- worst case
- np complete
- multiple agents
- multi agent systems
- graph matching
- complex systems
- multiagent systems
- information sharing
- distributed agents
- graph mining
- graph clustering
- multi agent
- multi agent coordination
- neural gas
- series parallel
- pairwise
- subgraph isomorphism
- graph search
- graph construction
- random graphs
- graphical models
- graph representation
- complex structures
- graph databases
- weighted graph
- graph structure
- bipartite graph
- approximation algorithms