Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10331886 | Information Processing Letters | 2015 | 4 Pages |
Abstract
We characterize when a digraph has topological additive numberings, give a lower bound for ηt(D) and provide an integer programming formulation for our problem. We also present some families for which ηt(D) can be computed in polynomial time. Finally, we prove that this problem is NP-Hard even when its input is restricted to planar bipartite digraphs.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Javier Marenco, Marcelo Mydlarz, Daniel SeverÃn,