Metraipolis › archive › dc_3b2c77ea1089
Planarity testing — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Planarity_testing
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-31T08:55:05.587Z
- SHA-256 of the archived text
aeaf3395e18b264ebddd63b2776431fb1a5398c5bf2d63b7a4a53ae270ecba60- Stable URL of this page
https://metraipolis.com/documento/dc_3b2c77ea1089
How to cite
Planarity testing — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Planarity_testing (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_3b2c77ea1089 (Metraipolis archive dc_3b2c77ea1089, sha256 aeaf3395e18b264ebddd63b2776431fb1a5398c5bf2d63b7a4a53ae270ecba60)
BibTeX
@misc{dc3b2c77ea1089,
title = {Planarity testing — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Planarity_testing},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_3b2c77ea1089; sha256 aeaf3395e18b264ebddd63b2776431fb1a5398c5bf2d63b7a4a53ae270ecba60},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Planarity_testing. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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. Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «graph theory»). Fonte: Wikipedia in inglese, voce «Planarity testing» — https://en.wikipedia.org/wiki/Planarity_testing Wikidata Q7200967: «algorithmic problem of testing whether a given graph is a planar graph» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q7200967 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Planarity_testing?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1374712100, consultata il 2026-10-31T08:43:31.624Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: afbb4f7fdea01de70fac78268cfeda588ed857956b7a1a1c1e81f0a15b77577f