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 2023-12-22 10:25
Algorithms for Optimally Shifting Intervals under Intersection Graph Models
Honorato Droguett Nicolas, Kazuhiro Kurita (Nagoya Univ.), Tesshu Hanaka (Kyushu Univ.), Hirotaka Ono (Nagoya Univ.) COMP2023-17
Abstract (in Japanese) (See Japanese page) 
(in English) We address a general optimisation problem of minimising the moving distance applied to the objects of an intersection graph, to achieve a specific characteristic within the associated graph. Our primary focus is on cases where the intersection graph takes the form of an interval graph. We study this problem in the context of graph edit distance, a metric used to measure the dissimilarity between two graphs.

Our main contribution is a linear-time algorithm that transforms an interval graph into a complete graph, while minimising the moving distance applied to intervals. In cases where the moving distance function is unique for all intervals, we demonstrate that the minimum moving distance is always found at the $n$-th and $n+1$-th endpoints.

In addition, we provide linear programming solutions to achieve several characteristics in the associated graph of unit intervals: (i) edgeless graph, (ii) acyclic graph, (iii) nonexistence of $k$-clique, and (iv) $k$-connected graph. Lastly, we describe two applications of the previous results, for (i) attaining the existence of a $k$-clique on unit interval graphs and (ii) transforming a unit square graph into a complete graph over $L_infty$ distance.
Keyword (in Japanese) (See Japanese page) 
(in English) intersection graphs / optimisation / graph edit distance / / / / /  
Reference Info. IEICE Tech. Rep., vol. 123, no. 325, COMP2023-17, pp. 6-11, Dec. 2023.
Paper # COMP2023-17 
Date of Issue 2023-12-15 (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 COMP2023-17

Conference Information
Committee COMP  
Conference Date 2023-12-22 - 2023-12-22 
Place (in Japanese) (See Japanese page) 
Place (in English) Miyazaki Univ. Machinaka Campus 
Topics (in Japanese) (See Japanese page) 
Topics (in English) Theoretical Computer Science, etc 
Paper Information
Registration To COMP 
Conference Code 2023-12-COMP 
Language English 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Algorithms for Optimally Shifting Intervals under Intersection Graph Models 
Sub Title (in English)  
Keyword(1) intersection graphs  
Keyword(2) optimisation  
Keyword(3) graph edit distance  
Keyword(4)  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Honorato Droguett Nicolas  
1st Author's Affiliation Nagoya University (Nagoya Univ.)
2nd Author's Name Kazuhiro Kurita  
2nd Author's Affiliation Nagoya University (Nagoya Univ.)
3rd Author's Name Tesshu Hanaka  
3rd Author's Affiliation Kyushu University (Kyushu Univ.)
4th Author's Name Hirotaka Ono  
4th Author's Affiliation Nagoya University (Nagoya Univ.)
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 ()
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-1 
Date Time 2023-12-22 10:25:00 
Presentation Time 25 minutes 
Registration for COMP 
Paper # COMP2023-17 
Volume (vol) vol.123 
Number (no) no.325 
Page pp.6-11 
#Pages 6 
Date of Issue 2023-12-15 (COMP) 

[Return to Top Page]

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