Vote count:
0
In graph theory, what are some well known algorithms for choosing a set of non-directional edges E such that each node v is connected by exactly N edges from E (or N±1 in worst case)?
asked 30 secs ago
Choosing balanced edges in a graph
Aucun commentaire:
Enregistrer un commentaire