Embedding problems for paths with direction constrained edges

Author： Battista G.D. Liotta G. Lubiw A. Whitesides S.

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.289, Iss.2, 2002-10, pp. : 897-917

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Fast Constrained Surface Extraction by Minimal Paths

By Ardon Roberto Cohen Laurent

International Journal of Computer Vision, Vol. 69, Iss. 1, 2006-08 ,pp. : 127-136

Springer Publishing Company

Access to resources Recommend Favorite

On Bounded Leg Shortest Paths Problems

By Roditty Liam Segal Michael

Algorithmica, Vol. 59, Iss. 4, 2011-04 ,pp. : 583-600

Springer Publishing Company

Access to resources Recommend Favorite

Cardinality constrained bin-packing problems

By Kellerer H. Pferschy U.

Annals of Operations Research, Vol. 92, Iss. 1, 1999-01 ,pp. : 335-348

Springer Publishing Company

Access to resources Recommend Favorite

Methods of embedding-cutting off in problems of mathematical programming

By Bulatov Valerian

Journal of Global Optimization, Vol. 48, Iss. 1, 2010-09 ,pp. : 3-15

Springer Publishing Company

Access to resources Recommend Favorite

Exact Max-SAT solvers for over-constrained problems

By Argelich Josep Manyà Felip

Journal of Heuristics, Vol. 12, Iss. 4-5, 2006-09 ,pp. : 375-392

Springer Publishing Company

Access to resources Recommend Favorite