| IEICE Technical Committee Submission System Conference Paper's Information |
Online Proceedings [Sign in] Tech. Rep. Archives |
| Go Top Page | Go Previous | [Japanese] / [English] |
| Paper Abstract and Keywords | ||
| Presentation | 2022-10-26 14:30 Efficient Enumeration of Spanning Subgraphs in Planar Graphs with Edge Connectivity Constraints Yasuaki Kobayashi (Hokkaido Univ.), Kazuhiro Kurita (Nagoya Univ.), Kunihiro Wasa (Hosei Univ.)  COMP2022-17 |
|
| Abstract | (in Japanese) | (See Japanese page) |
| (in English) | In this paper, we address an efficient enumeration of spanning subgraphs in planar graphs with edge-connected constraints. We propose two efficient algorithms. Our first algorithm enumerates all k-edge connected spanning subgraphs in planar graphs in amortized linear time and linear space. The other enumerates all minimal 2-edge connected spanning subgraphs in planar graphs in polynomial delay and exponential space. | |
| Keyword | (in Japanese) | (See Japanese page) |
| (in English) | Polynomial-delay enumeration / Edge-connectivity / Planar graphs / / / / / | |
| Reference Info. | IEICE Tech. Rep., vol. 122, no. 229, COMP2022-17, pp. 21-28, Oct. 2022. | |
| Paper # | COMP2022-17 | |
| Date of Issue | 2022-10-19 (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-17 |
|
| Conference Information | |
| Committee | COMP |
| Conference Date | 2022-10-26 - 2022-10-26 |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Kyusyu Univ. Nishijin Plaza |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | Theoretical Computer Science, etc |
| Paper Information | |
| Registration To | COMP |
| Conference Code | 2022-10-COMP |
| Language | English (Japanese title is available) |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Efficient Enumeration of Spanning Subgraphs in Planar Graphs with Edge Connectivity Constraints |
| Sub Title (in English) | |
| Keyword(1) | Polynomial-delay enumeration |
| Keyword(2) | Edge-connectivity |
| Keyword(3) | Planar graphs |
| Keyword(4) | |
| Keyword(5) | |
| Keyword(6) | |
| Keyword(7) | |
| Keyword(8) | |
| 1st Author's Name | Yasuaki Kobayashi |
| 1st Author's Affiliation | Hokkaido University (Hokkaido Univ.) |
| 2nd Author's Name | Kazuhiro Kurita |
| 2nd Author's Affiliation | Nagoya University (Nagoya Univ.) |
| 3rd Author's Name | Kunihiro Wasa |
| 3rd Author's Affiliation | Hosei University (Hosei Univ.) |
| 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 | () |
| Speaker | Author-2 |
| Date Time | 2022-10-26 14:30:00 |
| Presentation Time | 30 minutes |
| Registration for | COMP |
| Paper # | COMP2022-17 |
| Volume (vol) | vol.122 |
| Number (no) | no.229 |
| Page | pp.21-28 |
| #Pages | 8 |
| Date of Issue | 2022-10-19 (COMP) |
[Return to Top Page]