The above article has been cited by the articles listed below.
Hirotoshi Honma, Shigeru Masuyama,
A parallel algorithm for finding all hinge vertices of an interval graph ,
IEICE Transaction on Information and Systems E84-D (2001) 419-423.(*) Debashis Bera, Madhumangal Pal, Tapan K. Pal,
The optimal sequential and parallel algorithms to compute all hinge vertices on interval graphs ,
Journal of Applied Mathematics and Computing 8 (2001) 295-309. Fang-Rong Hsu, M. K. Shan, H. S. Chao and Richard C.-T. Lee,
Some optimal parallel algorithms for shortest path related problems on interval and circular-arc graphs ,
Proceedings of the 19th Workshop on Combinatorial Mathematics and Computation Theory , Kaohsiung, Taiwan, March 29-30, 2002, pp. 79-88. Hirotoshi Honma, Shigeru Masuyama,
A parallel algorithm for finding all hinge vertices of a trapezoid graph ,
IEICE Transaction on Fundamentals of Electronics Communications and Computer Sciences E85-A (2002) 1031-1040.(*) Debashis Bera, Madhumangal Pal, Tapan K. Pal,
An efficient algorithm for finding all hinge vertices on trapezoid graphs ,
Theory of Computing Systems 36 (2003) 17-27.(*) Fang-Rong Hsu, M. K. Shan, H. S. Chao and Richard C.-T. Lee,
Some optimal parallel algorithms on interval and circular-arc graphs ,
Journal of Information Science and Engineering 21 (2005) 627-642.(*) Swagata Mandal, Madhumangal Pal,
An optimal sequential algorithm to compute all hinge vertices on circular-arc graphs ,
Arab Journal of Mathematics and Mathematical Sciences 1 (2007) 1-12. Hirotoshi Honma, Shigeru Masuyama,
An optimal parallel algorithm for finding all hinge vertices of a circular-arc graph ,
IEICE Transaction on Fundamentals of Electronics Communications and Computer Sciences E91-A (2008) 383-391.(*) Yen-Ju Chen, Shyue-Ming Tang, Yue-Li Wang.
A linear time algorithm for solving the incidence coloring problem on strongly chordal graphs ,
Proceedings of the 25th Workshop on Combinatorial Mathematics and Computation Theory , Hsinchu, Taiwan, April 25-26, 2008, pp. 325-330. Terry A. McKee,
Minimal weak separators of chordal graphs ,
Ars Combinatoria 101 (2011) 321-331.(*) Hirotoshi Honma, Kodai Abe, Shigeru Masuyama,
Erratum and addendum to "A linear time algorithm for finding all hinge vertices of a permutation graph" [Information Processing Letters 59 (2) (1996) 103-107] ,
Information Processing Letters 111 (2011) 891-894.(*) Hirotoshi Honma, Kodai Abe, Yoko Nakajima, Shigeru Masuyama,
Linear Time algorithms for finding articulation and hinge vertices of circular permutation graphs ,
IEICE Transactions on Information and Systems E96-D (2013) 419-425.(*) Hirotoshi Honma, Yoko Nakajima, Yuta Igarashi, Shigeru Masuyama,
Algorithms for finding maximaum detour hinge vertices of interval graphs ,
IEICE Transaction on Fundamentals of Electronics Communications and Computer Sciences E97-A (2014) 1365-1369.(*) Hirotoshi Honma, Yoko Nakajima, Yuta Igarashi, Shigeru Masuyama,
Algorithms for identifying the maximaum detour hinge vertices of a permutation graph ,
IEICE Transaction on Fundamentals of Electronics Communications and Computer Sciences E98-A (2015) 1161-1167.(*) Hirotoshi Honma, Yoko Nakajima, Shigeru Masuyama,
An algorithm for hinge vertex problem on circular trapezoid graphs ,
Journal of Information Processing 25 (2017) 945-948. Hendrik Richter,
Evolution of cooperation for multiple mutant configurations on all regular graphs wit N <= 14 Players ,
Games 11 (2020) Article 12.(*) Hendrik Richter,
Constructing transient amplifiers for death-Birth updating: A case study of cubic and quartic regular graphs ,
arXiv:2008.01446v1 Hirotoshi Honma, Yoko Nakajima, Shigeru Masuyama,
An algorithm for the influential hinge vertex problem on interval graphs ,
Journal of Information Processing 28 (2020) 1047-1051. Hendrik Richter,
Spectral analysis of transient amplifiers for death-birth updating constructed from regular graphs ,
Journal of Mathematical Biology 82 (2021) Article number: 61.(*)
Times cited: 12