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 2016-09-06 16:20
Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs
Kenjiro Takazawa (Hosei Univ.) COMP2016-22
Abstract (in Japanese) (See Japanese page) 
(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 is
called 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) 
(in English) / / / / / / /  
Reference Info. IEICE Tech. Rep., vol. 116, no. 211, COMP2016-22, pp. 53-60, Sept. 2016.
Paper # COMP2016-22 
Date of Issue 2016-08-30 (COMP) 
ISSN Print edition: ISSN 0913-5685    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 COMP2016-22

Conference Information
Committee COMP  
Conference Date 2016-09-06 - 2016-09-06 
Place (in Japanese) (See Japanese page) 
Place (in English) Toyama Prefectural University 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2016-09-COMP 
Language English 
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)  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Kenjiro Takazawa  
1st Author's Affiliation Hosei University (Hosei Univ.)
2nd Author's Name  
2nd Author's Affiliation ()
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 2016-09-06 16:20:00 
Presentation Time 30 minutes 
Registration for COMP 
Paper # COMP2016-22 
Volume (vol) vol.116 
Number (no) no.211 
Page pp.53-60 
#Pages
Date of Issue 2016-08-30 (COMP) 


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan