- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- BIRS Workshop Lecture Videos /
- Multi-Clique-Width, a Powerful New Width Parameter
Open Collections
BIRS Workshop Lecture Videos
BIRS Workshop Lecture Videos
Multi-Clique-Width, a Powerful New Width Parameter Fürer, Martin
Description
Multi-clique-width is obtained by a simple modication in the denition of clique-width. It has the advantage of providing a natural extension of tree-width. Unlike clique-width, it does not explode exponentially compared to tree-width. Ecient algorithms based on multi-clique-width are still possible for interesting tasks like computing the independent set polynomial or testing c-colorability. In particular, c-colorability can be tested in time linear in n and singly exponential in c and the width k of a given multi-k-expression. For these tasks, the running time as a function of the multi-clique-width is the same as the running time of the fastest known algorithm as a function of the clique-width. This results in an exponential speed-up for some graphs, if the corresponding graph generating expressions are given. The reason is that the multi-clique-width is never bigger, but is exponentially smaller than the clique-width for many graphs.
Item Metadata
Title |
Multi-Clique-Width, a Powerful New Width Parameter
|
Creator | |
Publisher |
Banff International Research Station for Mathematical Innovation and Discovery
|
Date Issued |
2015-12-04T09:31
|
Description |
Multi-clique-width is obtained by a simple modication in the denition of clique-width. It has
the advantage of providing a natural extension of tree-width. Unlike clique-width, it does not explode
exponentially compared to tree-width. Ecient algorithms based on multi-clique-width are still possible
for interesting tasks like computing the independent set polynomial or testing c-colorability. In particular,
c-colorability can be tested in time linear in n and singly exponential in c and the width k of a given
multi-k-expression. For these tasks, the running time as a function of the multi-clique-width is the same
as the running time of the fastest known algorithm as a function of the clique-width. This results in an
exponential speed-up for some graphs, if the corresponding graph generating expressions are given. The
reason is that the multi-clique-width is never bigger, but is exponentially smaller than the clique-width for
many graphs.
|
Extent |
33 minutes
|
Subject | |
Type | |
File Format |
video/mp4
|
Language |
eng
|
Notes |
Author affiliation: The Pennsylvania State University
|
Series | |
Date Available |
2016-09-20
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
Attribution-NonCommercial-NoDerivatives 4.0 International
|
DOI |
10.14288/1.0314348
|
URI | |
Affiliation | |
Peer Review Status |
Unreviewed
|
Scholarly Level |
Faculty
|
Rights URI | |
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International