-
1Academic Journal
المساهمون: The Pennsylvania State University CiteSeerX Archives
المصدر: http://www.inf.u-szeged.hu/tanszekek/kepfeldolgozasesszg/publications/papers/frosini2005.pdf.
مصطلحات موضوعية: Discrete tomography, absorbed projections, reconstruction problem, polynomial time algorithm. 1
وصف الملف: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.412.9185; http://www.inf.u-szeged.hu/tanszekek/kepfeldolgozasesszg/publications/papers/frosini2005.pdf
-
2Academic Journal
المؤلفون: Vladimir G. Deineko, René van Dal, Günter Rote
المساهمون: The Pennsylvania State University CiteSeerX Archives
مصطلحات موضوعية: Euclidean Traveling Salesman Problem, shortest path, well-solvable case, polynomial time algorithm. 1
وصف الملف: application/postscript
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.3611; http://www.inf.fu-berlin.de/~rote/Papers/postscript-gzipped/The+convex-hull-and-line+traveling+salesman+problem:+A+solvable+case.ps.gz
-
3Academic Journal
المؤلفون: H. L. M. Kerivin, M. Lacroix, A. R. Mahjoub
المساهمون: The Pennsylvania State University CiteSeerX Archives
المصدر: http://lipn.univ-paris13.fr/~lacroix/Documents/Papiers/onTheComplexityOfTheECWPPCP_ISCO.pdf.
مصطلحات موضوعية: Eulerian closed walk, precedence path constraints, NP-completeness, polynomial-time algorithm. 1
وصف الملف: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.403.3291; http://lipn.univ-paris13.fr/~lacroix/Documents/Papiers/onTheComplexityOfTheECWPPCP_ISCO.pdf