Results 1  10
of
107,675
Fast Programs for Finding Maximum Planar Subgraphs
"... A previously reported, parallel method for calculating approximately maximum planar subgraphs has shown promising results, but was slow. The results of an initial implementation on the Connection Machine 2 prompted an investigation of more efficient methods of implementing the procedure. An improved ..."
Abstract
 Add to MetaCart
A previously reported, parallel method for calculating approximately maximum planar subgraphs has shown promising results, but was slow. The results of an initial implementation on the Connection Machine 2 prompted an investigation of more efficient methods of implementing the procedure
Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools
 ALGORITHMICA
, 1996
"... ..."
Solving the Maximum Weight Planar Subgraph Problem by Branch and Cut
 PROCEEDINGS OF THE THIRD CONFERENCE ON INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION
, 1993
"... In this paper we investigate the problem of identifying a planar subgraph of maximum weight of a given edge weighted graph. In the theoretical part of the paper, the polytope of all planar subgraphs of a graph G is defined and studied. All subgraphs of a graph G, which are subdivisions of K 5 or K 3 ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
In this paper we investigate the problem of identifying a planar subgraph of maximum weight of a given edge weighted graph. In the theoretical part of the paper, the polytope of all planar subgraphs of a graph G is defined and studied. All subgraphs of a graph G, which are subdivisions of K 5 or K
On Maximum Symmetric Subgraphs
 Proc. of Graph Drawing 2000, Lecture Notes in Computer Science
, 2001
"... Let G be an nnode graph. We address the problem of computing a maximum symmetric graph H from G by deleting nodes, deleting edges, and contracting edges. This NPcomplete problem arises naturally from the objective of drawing G as symmetrically as possible. We show that its tractability for the spe ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Let G be an nnode graph. We address the problem of computing a maximum symmetric graph H from G by deleting nodes, deleting edges, and contracting edges. This NPcomplete problem arises naturally from the objective of drawing G as symmetrically as possible. We show that its tractability
BranchandBound Techniques for the Maximum Planar Subgraph Problem
, 1994
"... We present branchandbound algorithms for finding a maximum planar subgraph of a nonplanar graph. The problem has important applications in circuit layout, automated graph drawing, and facility layout. The algorithms described utilize heuristics to obtain an initial lower bound for the size of a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
of a maximum planar subgraph, then apply a sequence of fast preliminary tests for planarity to eliminate infeasible partial solutions. Computational experience is reported from testing the algorithms on a set of random nonplanar graphs and is encouraging. A bestfirst search technique is shown
The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems
 IN DIMACS GRAPH DRAWING '94, VOLUME 894 OF LNCS
, 1994
"... In [JM94] we used a branch and cut algorithm in order to determine a maximum weight planar subgraph of a given graph. One of the motivations was to produce a nice drawing of a given graph by drawing the found maximum planar subgraph, and then augmenting this drawing by the removed edges. Our exper ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
experiments indicate that drawing algorithms for planar graphs which require 2 or 3connectivity, resp. degreeconstraints, in addition to planarity often give "nicer" results. Thus we are led to the following problems: (1) Find a maximum planar subgraph with maximum degree d 2 IN. (2) Augment a
Fast custom instruction identification by convex subgraph enumeration
 In ASAP
, 2008
"... Automatic generation of custom instruction processors from highlevel application descriptions enables fast design space exploration, while offering very favorable performance and silicon area combinations. This work introduces a novel method for adapting the instruction set to match an application ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
Automatic generation of custom instruction processors from highlevel application descriptions enables fast design space exploration, while offering very favorable performance and silicon area combinations. This work introduces a novel method for adapting the instruction set to match an application
Two New Approximation Algorithms for the Maximum Planar Subgraph Problem
, 2006
"... The maximum planar subgraph problem (MPS) is defined as follows: given a graph G, find a largest planar subgraph of G. The problem is NPhard and it has applications in graph drawing and resource location optimization. Călinescu et al. [J. Alg. 27, 269302 (1998)] presented the first approximation a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The maximum planar subgraph problem (MPS) is defined as follows: given a graph G, find a largest planar subgraph of G. The problem is NPhard and it has applications in graph drawing and resource location optimization. Călinescu et al. [J. Alg. 27, 269302 (1998)] presented the first approximation
Results 1  10
of
107,675