Geodesic
Deciding Clique-Width for Graphs of Bounded Tree-Width
Journal of graph algorithms and applications, Special Issue on Selected Papers from the Seventh International Workshop on Algorithms and Data Structures, WADS 2001 , Tome 7 (2003) no. 2, pp. 141-180 Cet article a éte moissonné depuis la source Journal of Graph Algorythms and Applications website

Voir la notice de l'article

We show that there exists a linear time algorithm for deciding whether a graph of bounded tree-width has clique-width k for some fixed integer k. 
@article{JGAA_2003_7_2_a3,
     author = {Wolfgang Espelage and Frank Gurski and Egon Wanke},
     title = {Deciding {Clique-Width} for {Graphs} of {Bounded} {Tree-Width}},
     journal = {Journal of graph algorithms and applications},
     pages = {141--180},
     year = {2003},
     volume = {7},
     number = {2},
     doi = {10.7155/jgaa.00065},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00065/}
}
TY  - JOUR
AU  - Wolfgang Espelage
AU  - Frank Gurski
AU  - Egon Wanke
TI  - Deciding Clique-Width for Graphs of Bounded Tree-Width
JO  - Journal of graph algorithms and applications
PY  - 2003
SP  - 141
EP  - 180
VL  - 7
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00065/
DO  - 10.7155/jgaa.00065
LA  - en
ID  - JGAA_2003_7_2_a3
ER  - 
%0 Journal Article
%A Wolfgang Espelage
%A Frank Gurski
%A Egon Wanke
%T Deciding Clique-Width for Graphs of Bounded Tree-Width
%J Journal of graph algorithms and applications
%D 2003
%P 141-180
%V 7
%N 2
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00065/
%R 10.7155/jgaa.00065
%G en
%F JGAA_2003_7_2_a3
Wolfgang Espelage; Frank Gurski; Egon Wanke. Deciding Clique-Width for Graphs of Bounded Tree-Width. Journal of graph algorithms and applications, 
							Special Issue on Selected Papers from the Seventh International Workshop on Algorithms and Data Structures, WADS 2001
					, Tome 7 (2003) no. 2, pp. 141-180. doi: 10.7155/jgaa.00065

Cité par Sources :