Paper Abstract and Keywords |
Presentation |
2017-03-07 11:30
Extension of the Vertex Cover Problem to the Size-t Cycle Cover Problems Batchunag Dashdemberel, Osamu Watanabe (Tokyo Tech.) COMP2016-52 |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
We consider an extension of the Vertex Cover (VC) problem.
For a given graph,
its (edge) vertex cover (in short, VC) is a set of vertices
that has at least one end point for every edge of the graph.
For a specified parameter $t$,
we introduce the notion of ``size-$t$ cycle cover''
(in short, $vcct$),
which means a set of vertices
that has at least one vertex for every cycle consisting of $t$ vertices.
We consider the problem of computing
the mini size $vcct$ (in short, the $vcct$ problem),
and show that, for any $tge2$,
the NP-hardness of the problem.
For the case $t=4$,
we show an algorithm
that solves the $vccfour$ problem for any treewidth $k$ graph
in
$2^k cdot sqrt{12}^{k^2} cdot O(k^5n)$-time
(when a tree decomposition is given as an input). |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
vertex cover problem / cycle cover / bounded treewidth / FPT algorithm / / / / |
Reference Info. |
IEICE Tech. Rep., vol. 116, no. 503, COMP2016-52, pp. 11-18, March 2017. |
Paper # |
COMP2016-52 |
Date of Issue |
2017-02-28 (COMP) |
ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
Download PDF |
COMP2016-52 |
Conference Information |
Committee |
COMP |
Conference Date |
2017-03-07 - 2017-03-07 |
Place (in Japanese) |
(See Japanese page) |
Place (in English) |
Nanzan University |
Topics (in Japanese) |
(See Japanese page) |
Topics (in English) |
|
Paper Information |
Registration To |
COMP |
Conference Code |
2017-03-COMP |
Language |
English |
Title (in Japanese) |
(See Japanese page) |
Sub Title (in Japanese) |
(See Japanese page) |
Title (in English) |
Extension of the Vertex Cover Problem to the Size-t Cycle Cover Problems |
Sub Title (in English) |
|
Keyword(1) |
vertex cover problem |
Keyword(2) |
cycle cover |
Keyword(3) |
bounded treewidth |
Keyword(4) |
FPT algorithm |
Keyword(5) |
|
Keyword(6) |
|
Keyword(7) |
|
Keyword(8) |
|
1st Author's Name |
Batchunag Dashdemberel |
1st Author's Affiliation |
Tokyo Institute of Technology (Tokyo Tech.) |
2nd Author's Name |
Osamu Watanabe |
2nd Author's Affiliation |
Tokyo Institute of Technology (Tokyo Tech.) |
3rd Author's Name |
|
3rd Author's Affiliation |
() |
4th Author's Name |
|
4th Author's Affiliation |
() |
5th Author's Name |
|
5th Author's Affiliation |
() |
6th Author's Name |
|
6th Author's Affiliation |
() |
7th Author's Name |
|
7th Author's Affiliation |
() |
8th Author's Name |
|
8th Author's Affiliation |
() |
9th Author's Name |
|
9th Author's Affiliation |
() |
10th Author's Name |
|
10th Author's Affiliation |
() |
11th Author's Name |
|
11th Author's Affiliation |
() |
12th Author's Name |
|
12th Author's Affiliation |
() |
13th Author's Name |
|
13th Author's Affiliation |
() |
14th Author's Name |
|
14th Author's Affiliation |
() |
15th Author's Name |
|
15th Author's Affiliation |
() |
16th Author's Name |
|
16th Author's Affiliation |
() |
17th Author's Name |
|
17th Author's Affiliation |
() |
18th Author's Name |
|
18th Author's Affiliation |
() |
19th Author's Name |
|
19th Author's Affiliation |
() |
20th Author's Name |
|
20th Author's Affiliation |
() |
Speaker |
Author-1 |
Date Time |
2017-03-07 11:30:00 |
Presentation Time |
30 minutes |
Registration for |
COMP |
Paper # |
COMP2016-52 |
Volume (vol) |
vol.116 |
Number (no) |
no.503 |
Page |
pp.11-18 |
#Pages |
8 |
Date of Issue |
2017-02-28 (COMP) |
|