Keyword : intersection graphs

Algorithm for Identifying the Maximum Detour Hinge Vertices of a Permutation Graph
Hirotoshi HONMA Yoko NAKAJIMA Yuta IGARASHI Shigeru MASUYAMA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2015/06/01
Vol. E98-A  No. 6 ; pp. 1161-1167
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
design and analysis of algorithms, intersection graphs, maximum detour hinge vertex problem, permutation graph, 
 Summary | Full Text:PDF(589.8KB)
Algorithm for Finding Maximum Detour Hinge Vertices of Interval Graphs
Hirotoshi HONMA Yoko NAKAJIMA Yuta IGARASHI Shigeru MASUYAMA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2014/06/01
Vol. E97-A  No. 6 ; pp. 1365-1369
Type of Manuscript:  Special Section LETTER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
design and analysis of algorithms, maximum detour hinge vertex problem, intersection graphs, interval graphs, 
 Summary | Full Text:PDF(232KB)
A Linear-Time Algorithm for Constructing a Spanning Tree on Circular Trapezoid Graphs
Hirotoshi HONMA Yoko NAKAJIMA Haruka AOSHIMA Shigeru MASUYAMA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2013/06/01
Vol. E96-A  No. 6 ; pp. 1051-1058
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
design and analysis of algorithms, intersection graphs, circular trapezoid graphs, spanning tree problem, 
 Summary | Full Text:PDF(1MB)