On the complexity of path problems in properly colored directed graphs
Year of publication: |
2012
|
---|---|
Authors: | Granata, Donatella ; Behdani, Behnam ; Pardalos, Panos M. |
Published in: |
Journal of combinatorial optimization. - Norwell, Mass. : Springer Science + Business Media, ISSN 1382-6905, ZDB-ID 1339574-9. - Vol. 24.2012, 4, p. 459-467
|
Subject: | Graphentheorie | Graph theory |
-
Durugbo, Christopher, (2013)
-
Simplifying the input-output analysis through the use of topological graphs
Fedriani, Eugenio M., (2012)
-
SinkRank : an algorithm for identifying systemically important banks in payment systems
Soramäki, Kimmo, (2013)
- More ...
-
Decomposition algorithms for maximizing the lifetime of wireless sensor networks with mobile sinks
Behdani, Behnam, (2012)
-
Network interdiction via a Critical Disruption Path : branch-and-price algorithms
Granata, Donatella, (2013)
-
An integer-programming-based approach to the close-enough traveling salesman problem
Behdani, Behnam, (2014)
- More ...