Article Dans Une Revue Journal of Graph Algorithms and Applications Année : 2001

Connectivity of planar graphs

Résumé

We give here three simple linear time algorithms on planar graphs: a 4-connexity test for maximal planar graphs, an algorithm enumerating the triangles and a 3-connexity test. Although all these problems got already linear-time solutions, the presented algorithms are both simple and efficient. They are based on some new theoretical results.

Fichier non déposé

Dates et versions

hal-00005627 , version 1 (26-06-2005)

Identifiants

  • HAL Id : hal-00005627 , version 1

Citer

Hubert de Fraysseix, Patrice Ossona de Mendez. Connectivity of planar graphs. Journal of Graph Algorithms and Applications, 2001, 5(5), pp.93-105. ⟨hal-00005627⟩

Collections

105 Consultations
0 Téléchargements

Partager

  • More