Presentation 2022-10-26
Efficient Enumeration of Spanning Subgraphs in Planar Graphs with Edge Connectivity Constraints
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(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)
Keyword(in English) Polynomial-delay enumeration / Edge-connectivity / Planar graphs
Paper # COMP2022-17
Date of Issue 2022-10-19 (COMP)

Conference Information
Committee COMP
Conference Date 2022/10/26(1days)
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
Chair Hiroyuki Uno(Osaka Metropolitan Univ.)
Vice Chair Shuji Kijima(Shiga Univ.)
Secretary Shuji Kijima(Hosei Univ.)
Assistant Ei Ando(Senshu Univ.)

Paper Information
Registration To Technical Committee on Theoretical Foundations of Computing
Language ENG-JTITLE
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
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.)
Date 2022-10-26
Paper # COMP2022-17
Volume (vol) vol.122
Number (no) COMP-229
Page pp.pp.21-28(COMP),
#Pages 8
Date of Issue 2022-10-19 (COMP)