Presentation 2022-10-26
Enumeration of Transversal Edge-Partitions
Koki Shinraku, Yazhou He, Katsuhisa Yamanaka, Takashi Hirayama,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper, we consider the problem of enumerating transversal edge-partition of an irreducible triangulation. We propose an algorithm that enumerates all transversal edge-partition s of an irreducible triangulation $T$ with $n$ vertices in $mathcal{O}(n)$-time for each.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) enumeration algorithm / reverse search / transversal edge-partitions
Paper # COMP2022-16
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
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Enumeration of Transversal Edge-Partitions
Sub Title (in English)
Keyword(1) enumeration algorithm
Keyword(2) reverse search
Keyword(3) transversal edge-partitions
1st Author's Name Koki Shinraku
1st Author's Affiliation Iwate University(Iwate Univ.)
2nd Author's Name Yazhou He
2nd Author's Affiliation Iwate University(Iwate Univ.)
3rd Author's Name Katsuhisa Yamanaka
3rd Author's Affiliation Iwate University(Iwate Univ.)
4th Author's Name Takashi Hirayama
4th Author's Affiliation Iwate University(Iwate Univ.)
Date 2022-10-26
Paper # COMP2022-16
Volume (vol) vol.122
Number (no) COMP-229
Page pp.pp.14-20(COMP),
#Pages 7
Date of Issue 2022-10-19 (COMP)