Planarity testing
id:
planarity-testing-260-4487999
title:
Planarity testing
text:
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.
brand slug:
wiki
category slug:
encyclopedia
description:
Algorithmic problem of finding non-crossing drawings
original url:
https://en.wikipedia.org/wiki/Planarity_testing
date created:
date modified:
2023-11-09T00:50:09Z
main entity:
{"identifier":"Q7200967","url":"https://www.wikidata.org/entity/Q7200967"}
image:
fields total:
13
integrity:
14