# Ming-Tsan Juan

- Citations Per Year

- Citations Per Year

- Full text PDF available (0)

Learn More

- Ting-Yem Ho, Yue-Li Wang, Ming-Tsan Juan
- Inf. Process. Lett.
- 1996

If the distance of any two vertices becomes longer after a vertex u is removed, then u is called a hinge vertex. The fault of a hinge vertex will increase the overall communication cost in a network. Therefore, finding the set of all hinge vertices in a graph can be used to identify critical nodes in a real network. We shall propose a linear time algorithm… (More)

- ‹
- 1
- ›