Computing the Tutte Polynomial on Graphs of Bounded Clique-Width, extended abstract

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F05%3A00012170" target="_blank" >RIV/61989100:27240/05:00012170 - isvavai.cz</a>

Alternative codes found

RIV/00216224:14330/05:00012661

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Computing the Tutte Polynomial on Graphs of Bounded Clique-Width, extended abstract

Original language description

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 withoutinduced P4), and it is a more general notion than that of tree-width. We show a subexponential algorithm (running in time exp O(n^2/3) ) 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.

Czech name

Computing the Tutte Polynomial on Graphs of Bounded Clique-Width, extended abstract

Czech description

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 withoutinduced P4), and it is a more general notion than that of tree-width. We show a subexponential algorithm (running in time exp O(n^2/3) ) 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.

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BD - Information theory

OECD FORD branch

—

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2005

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

WG 2005

ISSN

0302-9743

e-ISSN

—

Volume of the periodical

3787

Issue of the periodical within the volume

2005

Country of publishing house

DE - GERMANY

Number of pages

9

Pages from-to

59-68

UT code for WoS article

—

EID of the result in the Scopus database

—