Jean-Pierre Nzali ; Koumpo Tanékou Porgy ; Hippolyte Tapamo - An algorithm for computing the reversal degree of planar topological graphs

arima:1831 - Revue Africaine de Recherche en Informatique et Mathématiques Appliquées, November 27, 2002, Volume 1, 2002 - https://doi.org/10.46298/arima.1831
An algorithm for computing the reversal degree of planar topological graphsArticle

Authors: Jean-Pierre Nzali 1,2; Koumpo Tanékou Porgy 1,2; Hippolyte Tapamo 1,2

  • 1 Département d'Informatique [Yaoundé]
  • 2 Département d'Informatique [Yaoundé I]

One characteristic of planar topological graphs is the reversal degree. In this paper, we propose an improve algorithm for calculating the reversal degree of a planar topological graphs. This algorithm explores various possible cases following the descending method. Practical tests carried out on machine, using graphs with more than fifty internal vertices of odd degree, have been realized within reasonable computing time.

https://doi.org/10.46298/arima.1831
Source: HAL:hal-01261700v1
Volume: Volume 1, 2002
Published on: November 27, 2002
Submitted on: April 29, 2002
Keywords: Planar topological graph, reversal degree, algorithm, map, GIS,graphe planaire topologique,degré de retournement,algorithme,carte,SIG,[INFO]Computer Science [cs],[MATH]Mathematics [math]

Share and export

Consultation statistics

This page has been seen 360 times.
This article's PDF has been downloaded 678 times.