Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6874750 | Journal of Discrete Algorithms | 2018 | 19 Pages |
Abstract
Moreover, we show that the DirectedMin-Betweenness (resp. DirectedMax-Betweenness) problem, where only mt (resp. only Mt) is given for each t=0,1,2,â¦,n, is polynomial.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Léo Pelletier, Irena Rusu,