Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Planarization> ?p ?o }
Showing triples 1 to 45 of
45
with 100 triples per page.
- Planarization abstract "In graph drawing, planarization is a method of extending drawing methods from planar graphs to graphs that are not planar, by embedding the non-planar graphs within a larger planar graph.Planarization may be performed by using any method to find a drawing (with crossings) for the given graph, and then replacing each crossing point by a new artificial vertex, causing each crossed edge to be subdivided into a path. The original graph will be represented as a immersion minor of its planarization.In incremental planarization, the planarization process is split into two stages. First, a large planar subgraph is found within the given graph. Then, the remaining edges that are not already part of this subgraph are added back one at a time, and routed through an embedding of the planar subgraph. When one of these edges crosses an already-embedded edge, the two edges that cross are replaced by two-edge paths, with a new artificial vertex that represents the crossing point placed at the middle of both paths. In some case a third local optimization stage is added to the planarization process, in which edges with many crossings are removed and re-added in an attempt to improve the planarization.".
- Planarization wikiPageID "43170363".
- Planarization wikiPageLength "9048".
- Planarization wikiPageOutDegree "20".
- Planarization wikiPageRevisionID "678819747".
- Planarization wikiPageWikiLink Approximation_algorithm.
- Planarization wikiPageWikiLink Approximation_ratio.
- Planarization wikiPageWikiLink Branch_and_cut.
- Planarization wikiPageWikiLink Category:Planar_graphs.
- Planarization wikiPageWikiLink Connected_graph.
- Planarization wikiPageWikiLink Connectivity_(graph_theory).
- Planarization wikiPageWikiLink Degree_(graph_theory).
- Planarization wikiPageWikiLink Dual_graph.
- Planarization wikiPageWikiLink Glossary_of_graph_theory.
- Planarization wikiPageWikiLink Graph_drawing.
- Planarization wikiPageWikiLink Graph_minor.
- Planarization wikiPageWikiLink Induced_subgraph.
- Planarization wikiPageWikiLink Local_search_(optimization).
- Planarization wikiPageWikiLink NP-hard.
- Planarization wikiPageWikiLink NP-hardness.
- Planarization wikiPageWikiLink Parameterized_complexity.
- Planarization wikiPageWikiLink Partial_k-tree.
- Planarization wikiPageWikiLink Planar_graph.
- Planarization wikiPageWikiLink Polynomial_time.
- Planarization wikiPageWikiLink Random_permutation.
- Planarization wikiPageWikiLink SNP_(complexity).
- Planarization wikiPageWikiLink Shortest_path_algorithm.
- Planarization wikiPageWikiLink Shortest_path_problem.
- Planarization wikiPageWikiLink Spanning_tree.
- Planarization wikiPageWikiLink Time_complexity.
- Planarization wikiPageWikiLinkText "Planarization".
- Planarization wikiPageWikiLinkText "planarization".
- Planarization hasPhotoCollection Planarization.
- Planarization wikiPageUsesTemplate Template:Harvtxt.
- Planarization wikiPageUsesTemplate Template:Reflist.
- Planarization subject Category:Planar_graphs.
- Planarization hypernym Method.
- Planarization type Software.
- Planarization comment "In graph drawing, planarization is a method of extending drawing methods from planar graphs to graphs that are not planar, by embedding the non-planar graphs within a larger planar graph.Planarization may be performed by using any method to find a drawing (with crossings) for the given graph, and then replacing each crossing point by a new artificial vertex, causing each crossed edge to be subdivided into a path.".
- Planarization label "Planarization".
- Planarization sameAs m.0113k7k8.
- Planarization sameAs Q18388881.
- Planarization sameAs Q18388881.
- Planarization wasDerivedFrom Planarization?oldid=678819747.
- Planarization isPrimaryTopicOf Planarization.