مرکز منطقه ای اطلاع رساني علوم و فناوري - On the complexity of the maximum biplanar subgraph problem

Title of article :

On the complexity of the maximum biplanar subgraph problem

Author/Authors :

Chang Wu Yu، نويسنده ,

Issue Information :

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

Pages :

From page :

239

To page :

250

Keywords :

Doubly convex-bipartitegraphs , P class , NC class , Crossing number , Maximum biplanar subgraph , Graph drawing

Journal title :

Information Sciences

Serial Year :

2000

Journal title :

Information Sciences

Record number :

176173

Link To Document :