Paper Abstract and Keywords |
Presentation |
2012-03-16 13:35
Parameterized complexity of coloring comparability-ke graphs Atsuhsi Saito, Yasuhiko Takenaga (UEC) COMP2011-51 |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
$\mathcal{F}-ke$ graphs is a class of graphs obtained by deleting at most $k$ edges from a graph in graph class $\mathcal{F}$. In this paper, we consider parameterized complexity of coloring comparability$-ke$ graphs. We show that vertex coloring of comparability$-ke$ graphs can be solved in $f(k)n^{O(1)}$ time for some function $f$ if the size of the maximum matching on the the Hasse diagram is $\frac{1}{k}\log n^{O(1)} $. We also prove that vertex coloring of comparability$-k$e graphs cannot be solved in $f(k)n^{O(1)}$ time for any function $f$ if the size of maximum matching on the Hasse diagram is $\frac{1}{k}\log n^{\omega (1)} $ under the exponential time hypothesis. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
vertex coloring / parameterized complexity / comparability-$ke$ graph / / / / / |
Reference Info. |
IEICE Tech. Rep., vol. 111, no. 494, COMP2011-51, pp. 31-38, March 2012. |
Paper # |
COMP2011-51 |
Date of Issue |
2012-03-09 (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 |
COMP2011-51 |
Conference Information |
Committee |
COMP |
Conference Date |
2012-03-16 - 2012-03-16 |
Place (in Japanese) |
(See Japanese page) |
Place (in English) |
Univ. of Tokyo |
Topics (in Japanese) |
(See Japanese page) |
Topics (in English) |
|
Paper Information |
Registration To |
COMP |
Conference Code |
2012-03-COMP |
Language |
Japanese |
Title (in Japanese) |
(See Japanese page) |
Sub Title (in Japanese) |
(See Japanese page) |
Title (in English) |
Parameterized complexity of coloring comparability-ke graphs |
Sub Title (in English) |
|
Keyword(1) |
vertex coloring |
Keyword(2) |
parameterized complexity |
Keyword(3) |
comparability-$ke$ graph |
Keyword(4) |
|
Keyword(5) |
|
Keyword(6) |
|
Keyword(7) |
|
Keyword(8) |
|
1st Author's Name |
Atsuhsi Saito |
1st Author's Affiliation |
The University of Electro-Communications (UEC) |
2nd Author's Name |
Yasuhiko Takenaga |
2nd Author's Affiliation |
The University of Electro-Communications (UEC) |
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 |
2012-03-16 13:35:00 |
Presentation Time |
35 minutes |
Registration for |
COMP |
Paper # |
COMP2011-51 |
Volume (vol) |
vol.111 |
Number (no) |
no.494 |
Page |
pp.31-38 |
#Pages |
8 |
Date of Issue |
2012-03-09 (COMP) |