Title of article
Finding monotone paths in edge-ordered graphs Original Research Article
Author/Authors
J. Katreni?، نويسنده , , G. Semani?in، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
9
From page
1624
To page
1632
Abstract
An edge-ordering of a graph image is a one-to-one function image from image to a subset of the set of positive integers. A path image in image is called an image-ascent if image increases along the edge sequence of image. The height image of image is the maximum length of an image-ascent in image.
Keywords
Complexity , Edge-ordering , NPNP-completeness , kk-path , Ascent , Monotone path
Journal title
Discrete Applied Mathematics
Serial Year
2010
Journal title
Discrete Applied Mathematics
Record number
887484
Link To Document