Abstract
The Tutte polynomial is a notoriously hard graph invariant, and efficient algorithms for it are known only for a few special graph classes, like for those of bounded tree‐width. The notion of clique‐width extends the definition of cographs (graphs without induced $P_4$), and it is a more general notion than that of tree‐width. We show a subexponential algorithm (running in time $\exp{O(n^{1-\varepsilon})}\,$) for computing the Tutte polynomial on graphs of bounded clique‐width. In fact, our algorithm computes the more general U‐polynomial.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
