Skip to content

Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract).

Daniel Kobler, Udi Rotics

VenueA*SODA
Year2001
ProceedingsSODA

Browse the full SODA paper archive.