Login / Signup
Linear Time Algorithms for Finding Articulation and Hinge Vertices of Circular Permutation Graphs.
Hirotoshi Honma
Kodai Abe
Yoko Nakajima
Shigeru Masuyama
Published in:
IEICE Trans. Inf. Syst. (2013)
Keyphrases
</>
graph theory
strongly connected
learning algorithm
worst case
theoretical analysis
weighted graph
data structure
computational cost
optimization problems
computationally efficient
significant improvement
maximum clique