Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
Three donor–acceptor (D–A)-containing cruciform luminophores, named DHCS-BC, DMCS-BC, and DTCS-BC, with twisted molecular… 
Highly Cited
2011
Highly Cited
2011
We have developed a ladder-type multifused thienyl–phenylene–thienylene–phenylene–thienyl (TPTPT) unit where each thiophene ring… 
2009
2009
This work was supported by \SystemIC2010" project of Korea Ministry of Knowledge Economy and by the Seoul R&BD Program… 
2006
2006
We report InAs-InGaAs quantum-dot vertical-cavity surface-emitting lasers (VCSELs) grown by molecular beam epitaxy with fully… 
2006
2006
Geographic routing in wireless sensor networks is based on the prerequisite that every node has information about its current… 
2005
2005
A comprehensive probabilistic methodology is proposed to solve the buffer insertion problem with the consideration of process… 
Highly Cited
1998
Highly Cited
1998
Selective and lateral overgrowth by Metal Organics Vapour Phase Epitaxy (MOVPE) was carried out until coalescence to produce… 
1995
1995
We construct an optimal linear algorithm for the maximal planar subgraph problem: given a graph G, find a planar subgraph G′ of G…