Finding the set of all hinge vertices for strongly chordal graphs in linear time-Reference-Cited by-同舟云学术

Finding the set of all hinge vertices for strongly chordal graphs in linear time

Published:1997-07 Issue:3-4 Volume:99 Page:173-182
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Chang Jou-Ming,Hsu Chiun-Chieh,Wang Yue-Li,Ho Ting-Yem

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference10 articles.

1. Characterizations of totally balanced matrices;Anstee;J. Algorithms,1984

2. The characterizations of hinge-free networks;Chang,1996

3. On rigid circuit graphs;Dirac,1961

4. Characterizations of strongly chordal graphs;Faber;Discrete Math.,1983

5. Incidence matrices and interval graphs;Fulkerson;Pacific J. Math.,1965

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

1. Spectral analysis of transient amplifiers for death–birth updating constructed from regular graphs;Journal of Mathematical Biology;2021-05-16

2. Evolution of Cooperation for Multiple Mutant Configurations on All Regular Graphs with N ≤ 14 Players;Games;2020-02-17

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

4. Algorithm for Finding Maximum Detour Hinge Vertices of Interval Graphs;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2014

5. Linear Time Algorithms for Finding Articulation and Hinge Vertices of Circular Permutation Graphs;IEICE Transactions on Information and Systems;2013