On the Recognition of Bipolarizable and P_4-simplicial Graphs

Abstract : The classes of Raspail (also known as Bipolarizable) and P_4-simplicial graphs were introduced by Hoàng and Reed who showed that both classes are perfectly orderable and admit polynomial-time recognition algorithms HR1. In this paper, we consider the recognition problem on these classes of graphs and present algorithms that solve it in O(n m) time. In particular, we prove properties and show that we can produce bipolarizable and P_4-simplicial orderings on the vertices of the input graph G, if such orderings exist, working only on P_3s that participate in a P_4 of G. The proposed recognition algorithms are simple, use simple data structures and both require O(n + m) space. Additionally, we show how our recognition algorithms can be augmented to provide certificates, whenever they decide that G is not bipolarizable or P_4-simplicial; the augmentation takes O(n + m) time and space. Finally, we include a diagram on class inclusions and the currently best recognition time complexities for a number of perfectly orderable classes of graphs.
Type de document :
Article dans une revue
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2005, 7, pp.231-254
Liste complète des métadonnées

Littérature citée [25 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00959039
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Soumis le : jeudi 13 mars 2014 - 17:09:13
Dernière modification le : mercredi 29 novembre 2017 - 10:26:23
Document(s) archivé(s) le : vendredi 13 juin 2014 - 12:17:44

Fichier

dm070114.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00959039, version 1

Collections

Citation

Stavros D. Nikolopoulos, Leonidas Palios. On the Recognition of Bipolarizable and P_4-simplicial Graphs. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2005, 7, pp.231-254. 〈hal-00959039〉

Partager

Métriques

Consultations de la notice

98

Téléchargements de fichiers

155