Algorithm for Identifying the Maximum Detour Hinge Vertices of a Permutation Graph-Reference-Cited by-同舟云学术

Algorithm for Identifying the Maximum Detour Hinge Vertices of a Permutation Graph

Published:2015 Issue:6 Volume:E98.A Page:1161-1167
ISSN:0916-8508
Container-title:IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
language:en
Short-container-title:IEICE Trans. Fundamentals

Author:

HONMA Hirotoshi¹,NAKAJIMA Yoko¹,IGARASHI Yuta²,MASUYAMA Shigeru³

Affiliation:

1. Department of Information Engineering, National Institute of Technology, Kushiro College

2. Electronic Information System Engineering Course, Kushiro National College of Technology

3. Department of Computer Science and Engineering, Toyohashi University of Technology

Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Subject

Applied Mathematics,Electrical and Electronic Engineering,Computer Graphics and Computer-Aided Design,Signal Processing

Link

https://www.jstage.jst.go.jp/article/transfun/E98.A/6/E98.A_1161/_pdf

Reference16 articles.

1. [1] J.M. Chang, C.C. Hsu, Y.L. Wang, and T.Y. Ho, “Finding the set of all hinge vertices for strongly chordal graphs in linear time,” Inf. Sci., vol.99, no.3-4, pp.173-182, 1997.

2. [2] H. Honma and S. Masuyama, “A parallel algorithm for finding all hinge vertices of an interval graph,” IEICE Trans. Inf. & Syst., vol.E84-D, no.3, pp.419-423, March 2001.

3. [3] H. Honma, Y. Nakajima, Y. Igarashi, and S. Masuyama, “Algorithm for finding maximum detour hinge vertices of interval graphs,” IEICE Trans. Fundamentals, vol.E97-A, no.6, pp.1365-1369, June 2014.

4. [4] C. Papadopoulos, “Restricted vertex multicut on permutation graphs,” Discrete Appl. Math., vol.160, no.12, pp.1791-1797, 2012.

5. [5] O.H. Ibarra and Q. Zheng, “Some efficient algorithms for permutation graphs,” J. Algorithms, vol.16, pp.453-469, 1994.