AbstractThe 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
We consider the problems of finding the minimum-weight 2-connected spanning subgraph in edge-weighte...
Abstract. A plane graph is a planar graph with a fixed embedding. Let G = (V, E) be an edge weighted...
A spanning maximal planar subgraph T = (V E0) is a spanning planar subgraph of a simple, finite, und...
The problem of finding in a complete edge-weighted graph a two-connected planar spanning subgraph of...
AbstractThe problem of finding a two-connected planar spanning subgraph of maximum weight in a compl...
In Michael Jünger and Petra Mutzel [Algorithmica, 16 (1996)] we used a branch-and-cut algorithm in o...
In [JM94] we used a branch and cut algorithm in order to determine a maximum weight planar subgraph ...
In this paper we investigate the problem of identifying a planar subgraph of maximum weight of a giv...
We study the \tlpp s that have applications in Automatic Graph Drawing. We are searching for a two-l...
This paper studies the problem of finding a two-edge connected spanning subgraph of minimum weight. ...
AbstractWe further study some known families of valid inequalities for the 2-edge-connected and 2-no...
In automatic graph drawing a given graph has to be layed-out in the plane, usually according to a nu...
AbstractThis paper studies the graphs for which the 2-edge connected spanning subgraph polytope is c...
We consider a basic problem in the design of reliable networks, namely, that of finding a minimum-wi...
AbstractGiven a graph G=(V,E) with weights on its edges and a set of specified nodes S⊆V, the Steine...
We consider the problems of finding the minimum-weight 2-connected spanning subgraph in edge-weighte...
Abstract. A plane graph is a planar graph with a fixed embedding. Let G = (V, E) be an edge weighted...
A spanning maximal planar subgraph T = (V E0) is a spanning planar subgraph of a simple, finite, und...
The problem of finding in a complete edge-weighted graph a two-connected planar spanning subgraph of...
AbstractThe problem of finding a two-connected planar spanning subgraph of maximum weight in a compl...
In Michael Jünger and Petra Mutzel [Algorithmica, 16 (1996)] we used a branch-and-cut algorithm in o...
In [JM94] we used a branch and cut algorithm in order to determine a maximum weight planar subgraph ...
In this paper we investigate the problem of identifying a planar subgraph of maximum weight of a giv...
We study the \tlpp s that have applications in Automatic Graph Drawing. We are searching for a two-l...
This paper studies the problem of finding a two-edge connected spanning subgraph of minimum weight. ...
AbstractWe further study some known families of valid inequalities for the 2-edge-connected and 2-no...
In automatic graph drawing a given graph has to be layed-out in the plane, usually according to a nu...
AbstractThis paper studies the graphs for which the 2-edge connected spanning subgraph polytope is c...
We consider a basic problem in the design of reliable networks, namely, that of finding a minimum-wi...
AbstractGiven a graph G=(V,E) with weights on its edges and a set of specified nodes S⊆V, the Steine...
We consider the problems of finding the minimum-weight 2-connected spanning subgraph in edge-weighte...
Abstract. A plane graph is a planar graph with a fixed embedding. Let G = (V, E) be an edge weighted...
A spanning maximal planar subgraph T = (V E0) is a spanning planar subgraph of a simple, finite, und...
DOI
Add to ORKG