Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Planarity_testing> ?p ?o }
Showing triples 1 to 69 of
69
with 100 triples per page.
- Planarity_testing abstract "In graph theory, the planarity testing problem is the algorithmic problem of testing whether a given graph is a planar graph (that is, whether it can be drawn in the plane without edge intersections). This is a well-studied problem in computer science for which many practical algorithms have emerged, many taking advantage of novel data structures. Most of these methods operate in O(n) time (linear time), where n is the number of edges (or vertices) in the graph, which is asymptotically optimal. Rather than just being a single Boolean value, the output of a planarity testing algorithm may be a planar graph embedding, if the graph is planar, or an obstacle to planarity such as a Kuratowski subgraph if it is not.".
- Planarity_testing wikiPageID "15972636".
- Planarity_testing wikiPageLength "12106".
- Planarity_testing wikiPageOutDegree "49".
- Planarity_testing wikiPageRevisionID "690415041".
- Planarity_testing wikiPageWikiLink Abraham_Lempel.
- Planarity_testing wikiPageWikiLink Algorithm.
- Planarity_testing wikiPageWikiLink Asymptotically_optimal_algorithm.
- Planarity_testing wikiPageWikiLink Big_O_notation.
- Planarity_testing wikiPageWikiLink Category:Computational_problems_in_graph_theory.
- Planarity_testing wikiPageWikiLink Category:Planar_graphs.
- Planarity_testing wikiPageWikiLink Colin_de_Verdière_graph_invariant.
- Planarity_testing wikiPageWikiLink Complete_bipartite_graph.
- Planarity_testing wikiPageWikiLink Complete_graph.
- Planarity_testing wikiPageWikiLink Computer_science.
- Planarity_testing wikiPageWikiLink Cycle_space.
- Planarity_testing wikiPageWikiLink Data_structure.
- Planarity_testing wikiPageWikiLink Depth-first_search.
- Planarity_testing wikiPageWikiLink George_S._Lueker.
- Planarity_testing wikiPageWikiLink Glossary_of_graph_theory.
- Planarity_testing wikiPageWikiLink Graph_embedding.
- Planarity_testing wikiPageWikiLink Graph_isomorphism.
- Planarity_testing wikiPageWikiLink Graph_minor.
- Planarity_testing wikiPageWikiLink Graph_theory.
- Planarity_testing wikiPageWikiLink Graphic_matroid.
- Planarity_testing wikiPageWikiLink Homeomorphism_(graph_theory).
- Planarity_testing wikiPageWikiLink Induced_subgraph.
- Planarity_testing wikiPageWikiLink John_Hopcroft.
- Planarity_testing wikiPageWikiLink Kellogg_S._Booth.
- Planarity_testing wikiPageWikiLink Kuratowskis_theorem.
- Planarity_testing wikiPageWikiLink Kurt_Mehlhorn.
- Planarity_testing wikiPageWikiLink Left-right_planarity_test.
- Planarity_testing wikiPageWikiLink Library_of_Efficient_Data_types_and_Algorithms.
- Planarity_testing wikiPageWikiLink Mac_Lanes_planarity_criterion.
- Planarity_testing wikiPageWikiLink Order_dimension.
- Planarity_testing wikiPageWikiLink PQ_tree.
- Planarity_testing wikiPageWikiLink Partially_ordered_set.
- Planarity_testing wikiPageWikiLink Petra_Mutzel.
- Planarity_testing wikiPageWikiLink Planar_graph.
- Planarity_testing wikiPageWikiLink Robert_Tarjan.
- Planarity_testing wikiPageWikiLink Schnyders_theorem.
- Planarity_testing wikiPageWikiLink Shimon_Even.
- Planarity_testing wikiPageWikiLink Spectral_graph_theory.
- Planarity_testing wikiPageWikiLink Stefan_Näher.
- Planarity_testing wikiPageWikiLink Three_utilities_problem.
- Planarity_testing wikiPageWikiLink Tree_traversal.
- Planarity_testing wikiPageWikiLink Vertex_(graph_theory).
- Planarity_testing wikiPageWikiLink Wagners_theorem.
- Planarity_testing wikiPageWikiLink Whitneys_planarity_criterion.
- Planarity_testing wikiPageWikiLinkText "Planarity testing".
- Planarity_testing wikiPageWikiLinkText "determining whether a graph is planar".
- Planarity_testing wikiPageWikiLinkText "finding a planar embedding".
- Planarity_testing wikiPageWikiLinkText "planarity testing".
- Planarity_testing wikiPageWikiLinkText "testing the planarity".
- Planarity_testing wikiPageUsesTemplate Template:Reflist.
- Planarity_testing subject Category:Computational_problems_in_graph_theory.
- Planarity_testing subject Category:Planar_graphs.
- Planarity_testing hypernym Problem.
- Planarity_testing type Disease.
- Planarity_testing type Algorithm.
- Planarity_testing type Infographic.
- Planarity_testing comment "In graph theory, the planarity testing problem is the algorithmic problem of testing whether a given graph is a planar graph (that is, whether it can be drawn in the plane without edge intersections). This is a well-studied problem in computer science for which many practical algorithms have emerged, many taking advantage of novel data structures. Most of these methods operate in O(n) time (linear time), where n is the number of edges (or vertices) in the graph, which is asymptotically optimal.".
- Planarity_testing label "Planarity testing".
- Planarity_testing sameAs Q7200967.
- Planarity_testing sameAs m.03qjmg0.
- Planarity_testing sameAs Тестирање_планарности.
- Planarity_testing sameAs Q7200967.
- Planarity_testing wasDerivedFrom Planarity_testing?oldid=690415041.
- Planarity_testing isPrimaryTopicOf Planarity_testing.