Geodesic
On the Recognition of Bipolarizable and P_4-simplicial Graphs
Discrete mathematics & theoretical computer science, Tome 7 (2005).

Voir la notice de l'article provenant de la source Episciences

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. 
@article{DMTCS_2005_7_a9,
     author = {Nikolopoulos, Stavros D. and Palios, Leonidas},
     title = {On the {Recognition} of {Bipolarizable} and {P_4-simplicial} {Graphs}},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {7},
     year = {2005},
     doi = {10.46298/dmtcs.351},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.351/}
}
TY  - JOUR
AU  - Nikolopoulos, Stavros D.
AU  - Palios, Leonidas
TI  - On the Recognition of Bipolarizable and P_4-simplicial Graphs
JO  - Discrete mathematics & theoretical computer science
PY  - 2005
VL  - 7
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.351/
DO  - 10.46298/dmtcs.351
LA  - en
ID  - DMTCS_2005_7_a9
ER  - 
%0 Journal Article
%A Nikolopoulos, Stavros D.
%A Palios, Leonidas
%T On the Recognition of Bipolarizable and P_4-simplicial Graphs
%J Discrete mathematics & theoretical computer science
%D 2005
%V 7
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.351/
%R 10.46298/dmtcs.351
%G en
%F DMTCS_2005_7_a9
Nikolopoulos, Stavros D.; Palios, Leonidas. On the Recognition of Bipolarizable and P_4-simplicial Graphs. Discrete mathematics & theoretical computer science, Tome 7 (2005). doi : 10.46298/dmtcs.351. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.351/

Cité par Sources :