Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Planarity_testing> ?p ?o. }
Showing items 1 to 34 of
34
with 100 items 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 wikiPageRevisionID "567149769".
- Planarity_testing hasPhotoCollection Planarity_testing.
- Planarity_testing subject Category:Computational_problems_in_graph_theory.
- Planarity_testing subject Category:Planar_graphs.
- Planarity_testing type Abstraction100002137.
- Planarity_testing type Act100030358.
- Planarity_testing type Activity100407535.
- Planarity_testing type Algorithm105847438.
- Planarity_testing type Attribute100024264.
- Planarity_testing type Communication100033020.
- Planarity_testing type ComputationalProblemsInGraphTheory.
- Planarity_testing type Condition113920835.
- Planarity_testing type Difficulty114408086.
- Planarity_testing type Event100029378.
- Planarity_testing type Graph107000195.
- Planarity_testing type GraphAlgorithms.
- Planarity_testing type PlanarGraphs.
- Planarity_testing type Problem114410605.
- Planarity_testing type Procedure101023820.
- Planarity_testing type PsychologicalFeature100023100.
- Planarity_testing type Rule105846932.
- Planarity_testing type State100024720.
- Planarity_testing type VisualCommunication106873252.
- Planarity_testing type YagoPermanentlyLocatedEntity.
- 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 m.03qjmg0.
- Planarity_testing sameAs Q7200967.
- Planarity_testing sameAs Q7200967.
- Planarity_testing sameAs Planarity_testing.
- Planarity_testing wasDerivedFrom Planarity_testing?oldid=567149769.
- Planarity_testing isPrimaryTopicOf Planarity_testing.