Andreas Brandstädt, Hoang-Oanh Le, Raffaele Mosca  Home/Search
Context Related
| informatik.unirostock.de/...gcgfull.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: informatik.unirostock....artikel (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The P 4 is the induced path of four vertices. The gem consists of a P 4 with an additional universal vertex being completely adjacent to the P 4 , and the co-gem is its complement graph. Gem- and co-gem-free graphs generalize the popular class of cographs (i. e. P 4 -free graphs). The tree structure and algebraic generation of cographs has been crucial for several concepts of graph decomposition such as modular and homogeneous decomposition. Moreover, it is fundamental for the recently... (Update)
Similar documents based on text: More All
1.2: Treewidth and the Monadic Quantifier Hierarchy - Makowsky, Mariño (2001) (Correct)
0.8: A Sufficiently Fast Algorithm for Finding Close to Optimal.. - Becker, Geiger (1996) (Correct)
0.7: Linear Time Solvable Optimization Problems on Graphs of .. - Courcelle, Makowsky.. (1998) (Correct)
BibTeX entry: (Update)
A. Brandst adt, H.-O. Le, R. Mosca, Gem- and co-gem-free graphs have bounded clique width, Manuscript 2002; accepted for Internat. J. of Foundations of Computer Science http://citeseer.ist.psu.edu/brandst03gem.html More
@misc{ brandstadt-gem,
author = "Andreas Brandst{\"a}dt and Hoang-Oanh Le and Raffaele Mosca",
title = "Gem- and Co-Gem-Free Graphs Have Bounded Clique-Width",
url = "citeseer.ist.psu.edu/brandst03gem.html" }
Citations (may not include all citations):89 A linear recognition algorithm for cographs (context) - Corneil, Perl et al. - 1985
50 Complement reducible graphs (context) - Corneil, Lerchs et al. - 1981
48 Handle-rewriting hypergraph grammars (context) - Courcelle, Engelfriet et al. - 1993
47 A new linear algorithm for modular decomposition (context) - Cournier, Habib - 1994
41 Upper bounds to the clique-width of graphs - Courcelle, Olariu - 2000
36 Linear time solvable optimization problems on graphs of boun.. - Courcelle, Makowsky et al. - 2000
30 Modular decomposition and transitive orientation - McConnell, Spinrad - 1999
19 School of Computer Science (context) - ang, Graphs et al. - 1985
19 School of Computer Science (context) - ang, of et al. - 1983
15 Cographs: recognition (context) - Corneil, Perl et al. - 1984
15 Split graphs (context) - Foeldes, Hammer - 1977
14 Some classes of perfectly orderable graphs (context) - ang, Reed - 1989
11 SIAM Monographs on Discrete Math (context) - adt, Le and et al. - 1999
9 the clique-width of some perfect graph classes (context) - Golumbic, Rotics - 2000
9 NLC graphs and polynomial algorithms (context) - Wanke - 1994
[Article contains additional citations not shown here]
Documents on the same site (http://www.informatik.uni-rostock.de/~ab/artikel.html): More
Bisplit Graphs - Brandstädt, Hammer, al. (2002) (Correct)
Structure and Stability Number of Chair-, Co-P- and.. - Brandstädt, Le, Vanherpe (2002) (Correct)
Efficient Robust Algorithms for the Maximum Weight.. - Brandstädt, Le, de.. (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC