The Recognition of Geodetically Connected Graphs
Jou-Ming Chang and Chin-Wen Ho
Information Processing Letters, Vol. 65, No. 2, (1998) pp. 81-88.
The above article has been cited by the articles listed below.
Jou-Ming Chang, Chin-Wen Ho,
Recognizing hinge-free line graphs and total graphs
,
Taiwanese Journal of Mathematics
5 (2001) 789-801.
(*)
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.
(*)
Ján Plesník,
Towards minimum k-geodetically connected graphs
,
Networks
41 (2003) 73-82.
(*)
Ján Plesník,
Minimum k-geodetically connected digraphs
,
Networks
44 (2004) 243-253.
(*)
Ting-Yem Ho, Jou-Ming Chang,
An efficient distributed algorithm for finding all hinge vertices in networks
,
International Journal of Computer Mathematics
82 (2005) 821-827.
(*)
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.
Yingjie Lan, Songqing Chen,
Some special minimum k-geodetically connected graphs
,
Discrete Applied Mathematics
159 (2011) 1002-1012.
(*)
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.
(*)
Gilmar L. Vassoler, Marcia H. M. Paiva, Moises R. N. Ribeiro, Marcelo E. V. Segatto,
Twin datacenter interconnection topology
,
IEEE MICRO
34 (2014) 8-17.
(*)
M. H. M. Paiva, G. Caporossi, M. R. N. Ribeiro, M. E. V. Segatto
Evolving optical interconnection topology: from survivable rings to resilient meshes
,
Photonic Network Communications
.
(*)
Times cited:
9
(from Web of Science)