Paper Abstract and Keywords |
Presentation |
2023-05-11 15:25
Parameterized Complexity of Shortest Path Most Vital Edges Problem Yuto Ashida, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.) COMP2023-6 |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
Given an undirected graph $G$, vertices $s,t$ of $G$,and the number of removal edges $d$,the shortest paths most vital edges problem requires us to find the set $D$ of $d$ edges whose removal maximizes the distance between $s$ and $t$ in the graph $G-D$.
This problem was shown to be W[1]-hard with respect to parameters $d$ and the pathwidth of $G$.
In this paper, we show that this problem is also W[1]-hard even taking their sum as the parameter. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
tree decomposition / treewidth / FPT(fixed parameter tractable) / W[1]-hard / / / / |
Reference Info. |
IEICE Tech. Rep., vol. 123, no. 12, COMP2023-6, pp. 29-35, May 2023. |
Paper # |
COMP2023-6 |
Date of Issue |
2023-05-03 (COMP) |
ISSN |
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 |
COMP2023-6 |
Conference Information |
Committee |
COMP IPSJ-AL |
Conference Date |
2023-05-10 - 2023-05-11 |
Place (in Japanese) |
(See Japanese page) |
Place (in English) |
Hokkaido University |
Topics (in Japanese) |
(See Japanese page) |
Topics (in English) |
Theoretical Computer Science, etc |
Paper Information |
Registration To |
COMP |
Conference Code |
2023-05-COMP-AL |
Language |
Japanese |
Title (in Japanese) |
(See Japanese page) |
Sub Title (in Japanese) |
(See Japanese page) |
Title (in English) |
Parameterized Complexity of Shortest Path Most Vital Edges Problem |
Sub Title (in English) |
|
Keyword(1) |
tree decomposition |
Keyword(2) |
treewidth |
Keyword(3) |
FPT(fixed parameter tractable) |
Keyword(4) |
W[1]-hard |
Keyword(5) |
|
Keyword(6) |
|
Keyword(7) |
|
Keyword(8) |
|
1st Author's Name |
Yuto Ashida |
1st Author's Affiliation |
Osaka University (Osaka Univ.) |
2nd Author's Name |
Naoki Kitamura |
2nd Author's Affiliation |
Osaka University (Osaka Univ.) |
3rd Author's Name |
Taisuke Izumi |
3rd Author's Affiliation |
Osaka University (Osaka Univ.) |
4th Author's Name |
Toshimitsu Masuzawa |
4th Author's Affiliation |
Osaka University (Osaka Univ.) |
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 |
2023-05-11 15:25:00 |
Presentation Time |
25 minutes |
Registration for |
COMP |
Paper # |
COMP2023-6 |
Volume (vol) |
vol.123 |
Number (no) |
no.12 |
Page |
pp.29-35 |
#Pages |
7 |
Date of Issue |
2023-05-03 (COMP) |
|