Presentation | 2016-09-06 Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs Kenjiro Takazawa, |
---|---|
PDF Download Page | PDF download Page Link |
Abstract(in Japanese) | (See Japanese page) |
Abstract(in English) | We introduce a new framework of restricted 2-matchings close to Hamilton cycles. For an undirected graph (V,E) and a family U of its vertex subsets, a 2-matching F iscalled U-feasible if F does not contain a 2-factor in the subgraph induced by any element in U. Our framework can describe $C_k$-free 2-matchings, i.e., 2-matchings without cycles of at most k edges, and 2-factors covering prescribed edge cuts, both of which are intensively studied as relaxations of Hamilton cycles. We establish a min-max theorem, a combinatorial polynomial-time algorithm, and decomposition theorems for the case where the graph is bipartite and each element in U induces a Hamilton-laceable graph. This case generalizes the $C_4$-free 2-matching problem in bipartite graphs. |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | |
Paper # | COMP2016-22 |
Date of Issue | 2016-08-30 (COMP) |
Conference Information | |
Committee | COMP |
---|---|
Conference Date | 2016/9/6(1days) |
Place (in Japanese) | (See Japanese page) |
Place (in English) | Toyama Prefectural University |
Topics (in Japanese) | (See Japanese page) |
Topics (in English) | |
Chair | Hiroo Itoh(Univ. of Electro-Comm.) |
Vice Chair | Yuushi Uno(Osaka Pref. Univ.) |
Secretary | Yuushi Uno(Seikei Univ.) |
Assistant |
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) | Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs |
Sub Title (in English) | |
Keyword(1) | |
Keyword(2) | |
Keyword(3) | |
Keyword(4) | |
1st Author's Name | Kenjiro Takazawa |
1st Author's Affiliation | Hosei University(Hosei Univ.) |
Date | 2016-09-06 |
Paper # | COMP2016-22 |
Volume (vol) | vol.116 |
Number (no) | COMP-211 |
Page | pp.pp.53-60(COMP), |
#Pages | 8 |
Date of Issue | 2016-08-30 (COMP) |