W. ESPELAGE, F. GURSKI, E. WANKE, How to solve NP-hard graph problems on cliquewidth bounded graphs in polynomial time, Proceedings of the 27th Workshop on GraphTheoretic Concepts in Computer Science (WG 2001), LNCS 2204 (2001) 117-128 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Graph Decomposition Using Node Labels - Johansson (2001) (Correct)
....rid of the quadratic dependence on n, though, by not saving independent sets themselves, but only their sizes, as well as some extra information that allows us to reconstruct the solution at the end. More general approaches to dynamic programming with the help of decompositions can be found in [6, 7, 14, 27]. 1.5 Original Articles The rest of the thesis contains material as follows: Section 2.1 has not been published. It gives an informal presentation corresponding to a result in [8] when applied to the algebra in [9] these are by other authors) Section 2.2 then presents some results from [18] ....
Wolfgang Espelage, Frank Gurski, and Egon Wanke. How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time. In Proc. 27th Int. Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, Berlin, 2001. Springer. Forthcoming.
Deciding Clique-Width for Graphs of Bounded Tree-Width - Espelage, Gurski, Wanke (2003) Self-citation (Espelage Gurski Wanke) (Correct)
No context found.
W. Espelage, F. Gurski, and E. Wanke. How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time. In Proceedings of Graph-Theoretical Concepts in Computer Science, volume 2204 of LNCS, pages 117--128. Springer-Verlag, 2001.
Hans L. Bodlaender - Andreas Brandst Adt (2003) (Correct)
No context found.
W. ESPELAGE, F. GURSKI, E. WANKE, How to solve NP-hard graph problems on cliquewidth bounded graphs in polynomial time, Proceedings of the 27th Workshop on GraphTheoretic Concepts in Computer Science (WG 2001), LNCS 2204 (2001) 117-128
Graph Subcolorings: Complexity and Algorithms - Fiala, Jansen, Le, Seidel (2002) (2 citations) (Correct)
No context found.
W. Espelage, F. Gurski, E. Wanke, How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time. In: GraphTheoretic Concepts in Computer Science, 27th Int. Workshop (WG 20001), Lecture Notes in Computer Science 2204 (2001), in print 24
On Algorithms for (P_5,Gem)-Free Graphs - Bodlaender, Brandstädt, Kratsch, .. (2003) (Correct)
No context found.
W. ESPELAGE, F. GURSKI, E. WANKE, How to solve NP-hard graph problems on cliquewidth bounded graphs in polynomial time, Proceedings of the 27th Workshop on GraphTheoretic Concepts in Computer Science (WG 2001), LNCS 2204 (2001) 117-128
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