Information: Join today and make your research activities more affordable! Technical workshop participation fees and annual registration fees are available at member rates.
Notice: [Important] Announcement of Changes to Registration Fee Payment and Manuscript Upload Procedures for IEICE Technical Meetings
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 2024-10-24 10:00
Basis sequence reconfiguration in the union of matroids
Hanaka Tesshu (Kyushu Univ.), Yuni Iwamasa (Kyoto Univ.), Yasuaki Kobayashi (Hokkaido Univ.), Yuto Okada (Nagoya Univ.), Rin Saito (Tohoku Univ.) COMP2024-13
Abstract (in Japanese) (See Japanese page) 
(in English) Given a graph $G$ and two spanning trees $T$ and $T'$ in $G$, {scshape Spanning Tree Reconfiguration} asks whether there is a step-by-step transformation from $T$ to $T'$ such that all intermediates are also spanning trees of $G$, by exchanging an edge in $T$ with an edge outside $T$ at a single step.
This problem is naturally related to matroid theory, which shows that there always exists such a transformation for any pair of $T$ and $T'$.
Motivated by this example, we study the problem of transforming a sequence of spanning trees into another sequence of spanning trees.
We formulate this problem in the language of matroid theory: Given two sequences of bases of matroids, the goal is to decide whether there is a transformation between these sequences.
We design a polynomial-time algorithm for this problem, even if the matroids are given as basis oracles.
To complement this algorithmic result, we show that the problem of finding a shortest transformation is NP-hard to approximate within a factor of $c log n$ for some constant $c > 0$, where $n$ is the total size of the ground sets of the input matroids.
Keyword (in Japanese) (See Japanese page) 
(in English) Combinatorial Reconfiguration / Matroids / Polynomial-time algorithm / Inapproximability / / / /  
Reference Info. IEICE Tech. Rep., vol. 124, no. 223, COMP2024-13, pp. 1-8, Oct. 2024.
Paper # COMP2024-13 
Date of Issue 2024-10-17 (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 COMP2024-13

Conference Information
Committee COMP  
Conference Date 2024-10-24 - 2024-10-24 
Place (in Japanese) (See Japanese page) 
Place (in English) Tohoku University Aobayama Campus 
Topics (in Japanese) (See Japanese page) 
Topics (in English) Theoretical Computer Science, etc 
Paper Information
Registration To COMP 
Conference Code 2024-10-COMP 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Basis sequence reconfiguration in the union of matroids 
Sub Title (in English)  
Keyword(1) Combinatorial Reconfiguration  
Keyword(2) Matroids  
Keyword(3) Polynomial-time algorithm  
Keyword(4) Inapproximability  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Hanaka Tesshu  
1st Author's Affiliation Kyushu University (Kyushu Univ.)
2nd Author's Name Yuni Iwamasa  
2nd Author's Affiliation Kyoto University (Kyoto Univ.)
3rd Author's Name Yasuaki Kobayashi  
3rd Author's Affiliation Hokkaido University (Hokkaido Univ.)
4th Author's Name Yuto Okada  
4th Author's Affiliation Nagoya University (Nagoya Univ.)
5th Author's Name Rin Saito  
5th Author's Affiliation Tohoku University (Tohoku Univ.)
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 ()
21st Author's Name  
21st Author's Affiliation ()
22nd Author's Name  
22nd Author's Affiliation ()
23rd Author's Name  
23rd Author's Affiliation ()
24th Author's Name  
24th Author's Affiliation ()
25th Author's Name  
25th Author's Affiliation ()
26th Author's Name / /
26th Author's Affiliation ()
()
27th Author's Name / /
27th Author's Affiliation ()
()
28th Author's Name / /
28th Author's Affiliation ()
()
29th Author's Name / /
29th Author's Affiliation ()
()
30th Author's Name / /
30th Author's Affiliation ()
()
31st Author's Name / /
31st Author's Affiliation ()
()
32nd Author's Name / /
32nd Author's Affiliation ()
()
33rd Author's Name / /
33rd Author's Affiliation ()
()
34th Author's Name / /
34th Author's Affiliation ()
()
35th Author's Name / /
35th Author's Affiliation ()
()
36th Author's Name / /
36th Author's Affiliation ()
()
Speaker Author-5 
Date Time 2024-10-24 10:00:00 
Presentation Time 30 minutes 
Registration for COMP 
Paper # COMP2024-13 
Volume (vol) vol.124 
Number (no) no.223 
Page pp.1-8 
#Pages 8 
Date of Issue 2024-10-17 (COMP) 

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan