مرکز منطقه ای اطلاع رساني علوم و فناوري - Finding the maximum common subgraph of a partial k-tree and a graph with a polynomially bounded number of spanning trees

Title of article :

Finding the maximum common subgraph of a partial k-tree and a graph with a polynomially bounded number of spanning trees

Author/Authors :

Atsuko Yamaguchi، نويسنده , , Kiyoko F. Aoki، نويسنده , , Hiroshi Mamitsuka، نويسنده ,

Issue Information :

دوهفته نامه با شماره پیاپی سال 2004

Pages :

From page :

To page :

Keywords :

graph algorithms , computational complexity , Maximum common subgraph

Journal title :

Information Processing Letters

Serial Year :

2004

Journal title :

Information Processing Letters

Record number :

129967

Link To Document :