How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Wolfgang Espelage, Frank Gurski, Egon Wanke. How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time. In Andreas Brandstädt, Van Bang Le, editors, Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings. Volume 2204 of Lecture Notes in Computer Science, pages 117-128, Springer, 2001. [doi]

This author has not been identified. Look up 'Wolfgang Espelage' in GoogleThis author has not been identified. Look up 'Frank Gurski' in GoogleThis author has not been identified. Look up 'Egon Wanke' in Google

runs on WebDSL