Paper Abstract and Keywords |
Presentation |
2022-09-15 11:00
Toward Efficiency Enumeration of Minimal Induced Steiner Subgraphs in Series-Parallel Graphs Shun Onogi (TUT), Kunihiro Wasa (Hosei Univ.) COMP2022-11 |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
Given a graph ???? = (????, ????) with a terminal set ???? ⊆ ????, a vertex subset ???? ⊆ ???? is an induced Steiner subgraph (ISS)
if ???? [????] is connected and ???? ⊆ ????. Additionally, we say ???? is a minimal induced Steiner subgraph (MISS) if there is no proper
subset ????′ of ???? such that ???? [????′] is an ISS. In this paper, we consider an enumeration problem of MISSs in a graph. The task
is to output all MISS in a graph without duplicates. This problem is known to be as hard as minimal hypergraph transversal
enumeration even if we restrict inputs to split graphs[Conte et al., MFCS 2019]. As the main result of this paper, we give a
detailed analysis of solution sets of MISSs in series-paralle graphs by using an ear decomsition of an input graph. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
Graph algorithm / enumeration / induced Steiner subgraphs / series-parallel graphs / ear decomposition / / / |
Reference Info. |
IEICE Tech. Rep., vol. 122, no. 187, COMP2022-11, pp. 3-9, Sept. 2022. |
Paper # |
COMP2022-11 |
Date of Issue |
2022-09-08 (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 |
COMP2022-11 |
Conference Information |
Committee |
COMP IPSJ-AL |
Conference Date |
2022-09-15 - 2022-09-15 |
Place (in Japanese) |
(See Japanese page) |
Place (in English) |
Keio Univ. |
Topics (in Japanese) |
(See Japanese page) |
Topics (in English) |
Theoretical Computer Science, etc. |
Paper Information |
Registration To |
COMP |
Conference Code |
2022-09-COMP-AL |
Language |
Japanese |
Title (in Japanese) |
(See Japanese page) |
Sub Title (in Japanese) |
(See Japanese page) |
Title (in English) |
Toward Efficiency Enumeration of Minimal Induced Steiner Subgraphs in Series-Parallel Graphs |
Sub Title (in English) |
|
Keyword(1) |
Graph algorithm |
Keyword(2) |
enumeration |
Keyword(3) |
induced Steiner subgraphs |
Keyword(4) |
series-parallel graphs |
Keyword(5) |
ear decomposition |
Keyword(6) |
|
Keyword(7) |
|
Keyword(8) |
|
1st Author's Name |
Shun Onogi |
1st Author's Affiliation |
Toyohashi University of Technology (TUT) |
2nd Author's Name |
Kunihiro Wasa |
2nd Author's Affiliation |
Hosei University (Hosei Univ.) |
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 |
2022-09-15 11:00:00 |
Presentation Time |
30 minutes |
Registration for |
COMP |
Paper # |
COMP2022-11 |
Volume (vol) |
vol.122 |
Number (no) |
no.187 |
Page |
pp.3-9 |
#Pages |
7 |
Date of Issue |
2022-09-08 (COMP) |
|