A way to differentiate digraphs with adjacency matrices from regular graphs was needed for implementation of algorithms in the future. A file adjdigraph.go with the MatrixDigraph struct and some of ...
This experimental software is done as part of my master's thesis [1]. It is an implementation of the randomized polynomial time algorithm presented in Section 4.2 of the publication by Björklund, ...
ABSTRACT: This paper investigates allocation rules in graph-structured cooperative games (hereinafter referred to as graph games) by integrating the notion of network control. A component-restricted ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback