Algorithm for Finding Maximum Detour Hinge Vertices of Interval Graphs-Reference-Cited by-同舟云学术

Algorithm for Finding Maximum Detour Hinge Vertices of Interval Graphs

Published:2014 Issue:6 Volume:E97.A Page:1365-1369
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, Kushiro National College of Technology

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/E97.A/6/E97.A_1365/_pdf

Reference17 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] D.G. Kendall, “Incidence matrices, interval graphs and seriation in archeology,” Pacific J. Math., vol.28, no.3, pp.565-570, 1969.

4. [4] H. Kaplan and R. Shamir, “Pathwidth, bandwidth and completion problems to proper interval graphs with small cliques,” SIAM J. Comput., vol.25, no.3, pp.540-561, 1996.

5. [5] P. Zhang, E.A. Schon, S.G. Fischer, E. Cayanis, J. Weiss, S. Kistler, and P.E. Bourne, “An algorithm based on graph theory for the assembly of contigs in physical mapping of DNA,” Bioinformatics, vol.10, no.3, pp.309-317, 1994.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Algorithm for Identifying the Maximum Detour Hinge Vertices of a Permutation Graph;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2015