Abstract: Probabilistic graphs are challenging to visualize using the traditional node-link diagram. Encoding edge probability using visual variables like width or fuzziness makes it difficult for ...
Abstract: The Quadratic assignment problem (QAP), referring to finding an optimal assignment between two sets of interrelated objects, is a fundamental problem in combinatorial optimization. It is ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback