Old Web
English
Sign In
Acemap
>
Paper
>
Processes for a Colony Solving the Best-of-N Problem using a Bipartite Graph Representation
Processes for a Colony Solving the Best-of-N Problem using a Bipartite Graph Representation
2021
Puneet Jain
Michael A. Goodrich
Keywords:
representation
Bipartite graph
Combinatorics
Computer science
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]