Title of article :
On the two-connected planar spanning subgraph polytope
Author/Authors :
Caterina De Simone، نويسنده , , Michael Jünger، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1996
Abstract :
The problem of finding a two-connected planar spanning subgraph of maximum weight in a complete edge-weighted graph is important in automatic graph drawing. We investigate the problem from a polyhedral point of view.
Keywords :
Planar graphs , Two-connected graphs , Polyhedra , Facets
Journal title :
Discrete Applied Mathematics
Journal title :
Discrete Applied Mathematics