We provide the first formalization true to the best of our knowledge to the problem of finding bicliques in a directed graph. The problem is addressed employing a two-stage approach based on an ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback