B. COURCELLE, J.A. MAKOWSKY, U. ROTICS, Linear time solvable optimization problems on graphs of bounded clique-width, Theory of Computing Systems 33 (2000) 125-150 Home/Search Document Details and Download
Context Related Articles Check |
This paper is cited by the following papers:
First 50 documents
Gem- and Co-Gem-Free Graphs Have Bounded Clique-Width - Brandstädt, Le, Mosca (2003) (Correct)
Structure and Stability Number of Chair-, Co-P- and.. - Brandstädt, Le, Vanherpe (2002) (Correct)
On the Band-, Tree- and Clique-Width of Graphs With Bounded Vertex .. - Lozin (2002) (Correct)
Bipartite Graphs Without a Skew Star - Lozin (2001) (Correct)
How to solve NP-hard graph problems on clique-width.. - Espelage, Gurski, Wanke (2001) (4 citations) (Correct)
How to solve NP-hard graph problems on clique-width.. - Wolfgang Espelage Frank (2001) (4 citations) (Correct)
NLC_2-Decomposition In Polynomial Time - Johansson (1999) (Correct)
Descriptive and Parameterized Complexity - Grohe (1999) (1 citation) (Correct)
Hans L. Bodlaender - Andreas Brandst Adt (2003) (Correct)
Discovering Treewidth - Hans Bodlaender Institute (2005) (Correct)
Parameterized Power Domination Complexity - Kneis, Mölle, Richter, Rossmanith (2004) (Correct)
Parameterized Power Domination Complexity - Kneis, Mölle, Richter, Rossmanith (2004) (Correct)
New Graph Classes of Bounded Clique-Width - Brandstädt, Dragan, Le, Mosca (2003) (Correct)
Deciding Clique-Width for Graphs of Bounded Tree-Width - Espelage, Gurski, Wanke (2003) (Correct)
Chordal co-gem-free and (P_5,gem)-free graphs have bounded .. - Brandstädt, Le, Mosca (2002) (Correct)
New Graph Classes of Bounded Clique-Width - Brandstädt, Dragan, Le, Mosca (2002) (Correct)
New Graph Classes of Bounded Clique-Width II - Brandstädt, al. (2003) (Correct)
On the Structure and Stability Number of P_5- and.. - Brandstädt, Mosca (2002) (Correct)
On the Structure of (P_5,Gem)-Free Graphs - Brandstädt, Kratsch (2002) (Correct)
On Variations of P_4-Sparse Graphs - Brandstädt, Mosca (2002) (Correct)
On Algorithms for (P_5,Gem)-Free Graphs - Bodlaender, Brandstädt, Kratsch, .. (2003) (Correct)
The Building Blocks of Complexity: A Unified Criterion and.. - Seese, Schlottmann (2003) (Correct)
The Building Blocks of Complexity: A Unified Criterion and.. - Seese, Schlottmann (Correct)
Equistable Distance-Hereditary Graphs - Korach, Peled, Rotics Self-citation (Rotics) (Correct)
Treewidth and the Monadic Quantifier Hierarchy - Makowsky, Mariño (2001) Self-citation (Makowsky) (Correct)
First 50 documents
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