| dc.contributor.author | Giménez, Omer | |
| dc.contributor.author | Hliněný, Petr | |
| dc.contributor.author | Noy, Marc | |
| dc.date.accessioned | 2006-10-03T07:43:05Z | |
| dc.date.available | 2006-10-03T07:43:05Z | |
| dc.date.issued | 2005 | |
| dc.identifier.citation | Graph-theoretic concepts in computer science : 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005. Revised selected papers. 2005, p. 59-68. | en |
| dc.identifier.isbn | 978-3-540-31000-6 | |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.uri | http://hdl.handle.net/10084/56757 | |
| dc.description.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 cograhs (graphs without induced P4), and it is a more general notion than that of tree-width. We show a subexponential algorithm (running in time ) for computing the Tutte polynomial on cographs. The algorithm can be extended to a subexponential algorithm computing the Tutte polynomial on on all graphs of bounded clique-width. In fact, our algorithm computes the more general U-polynomial. | en |
| dc.language.iso | en | en |
| dc.publisher | Springer | en |
| dc.relation.ispartofseries | Graph-theoretic concepts in computer science : 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005. Revised selected papers | en |
| dc.relation.uri | http://dx.doi.org/10.1007/11604686_6 | en |
| dc.subject | Tutte polynomial | en |
| dc.subject | cographs | en |
| dc.subject | clique-width | en |
| dc.subject | subexponential algorithm | en |
| dc.subject | U polynomial | en |
| dc.title | Computing the Tutte polynomial on graphs of bounded clique-width | en |
| dc.type | article | en |
| dc.identifier.location | Není ve fondu ÚK | en |
| dc.identifier.doi | 10.1007/11604686_6 | |
| dc.identifier.wos | 000234875500006 | |