مرکز منطقه ای اطلاع رساني علوم و فناوري - Finding a minimum path cover of a distance-hereditary graph in polynomial time Original Research Article

Title of article :

Finding a minimum path cover of a distance-hereditary graph in polynomial time Original Research Article

Author/Authors :

Ruo-Wei Hung، نويسنده , , Maw-Shang Chang، نويسنده ,

Issue Information :

روزنامه با شماره پیاپی سال 2007

Pages :

From page :

2242

To page :

2256

Keywords :

Graph algorithms , Path cover , Distance-hereditary graphs , Hamiltonian path

Journal title :

Discrete Applied Mathematics

Serial Year :

2007

Journal title :

Discrete Applied Mathematics

Record number :

886588

Link To Document :