Searching for "Computing Graph Polynomials on Graphs of Bounded Clique-Width." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Computing graph polynomials on graphs of bounded clique-width
by J. A. Makowsky, Udi Rotics, Ilya Averbouch, Benny Godlin — Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006
…Computing Graph Polynomials on Graphs of Bounded Clique-Width J.A. Makowsky 1 , Udi Rotics 2…
Cited by 4 (2 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB