135 citations · 141 across the 14 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2019★ 1 cited
Integer Programming Approaches to Balanced Connected -Partition
Flávio K. Miyazawa, Phablo F. S. Moura, Matheus J. Ota +1
We address the problem of partitioning a vertex-weighted connected graph into connected subgraphs that have similar weights, for a fixed integer . This problem, known…
cs.DM2016
Dijkstra Graphs
Lucila M. S. Bento, Davidson R. Boccardo, Raphael C. S. Machado +3
We revisit a concept that has been central in some early stages of computer science, that of structured programming: a set of rules that an algorithm must follow in order to acquir…