2 search results - page 1 / 1 » Approximating clique-width and branch-width |
WG
2005
Springer
15 years 8 months ago
2005
Springer
151
Voted
TAMC
2010
Springer
15 years 1 months ago
2010
Springer
Clique-width is an important graph parameter whose computation is NP-hard. In fact we do not know of any other algorithm than brute force for the exact computation of clique-width...