Planarization

Known as: Maximal planar subgraph, Maximum planar subgraph problem, Maximal planar subgraph problem 
In graph drawing, planarization is a method of extending drawing methods from planar graphs to graphs that are not planar, by embedding the non… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
The problem of testing whether a graph is planar has been studied for over half a century, and is known to be solvable in O(n… (More)
Is this relevant?
2013
2013
Constraining 3D meshes to restricted classes is necessary in architectural and industrial design, but it can be very challenging… (More)
  • table 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
The planarization of patterned recording media is essential to overcome the ¿flying height reduction¿ and ¿flying instability¿ of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
It has been shown by Indyk and Sidiropoulos \cite{indyk_genus} that any graph of genus $g>0$ can be stochastically embedded into… (More)
  • figure 1
  • figure 2
Is this relevant?
2009
2009
Recently, we presented a new practical method for upward crossing minimization [6], which clearly outperformed existing… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
Wireless sensor networks need very efficient network protocols due to the sensors' limited communication and computation… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We present a new geographic routing algorithm, Greedy Distributed Spanning Tree Routing (GDSTR), that finds shorter routes and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
2004
A bipartite graph is biplanar if the vertices can be placed on two parallel lines in the plane such that there are no edge… (More)
  • figure 1
Is this relevant?
1994
1994
Given a graph G = (V, E ) , the graph planarization problem is to find a largest subset F of E, such that H = (V , F) is planar… (More)
  • table 1
Is this relevant?
1989
1989
Abstmct-In this paper we present two O ( n * ) planarization algorithms-PLANARIZE and MAXIMAL-PLANARIZE. These algorithms are… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
Is this relevant?