Finding pseudoperipheral nodes in graphs
作者：
Highlights：
•
摘要
The SPARSPAK [5] algorithm for finding pseudoperipheral nodes in graphs with n nodes and e edges has the worst case time complexity Ω(e ,√n). The function e √n is also an asymptotic upper bound for the worst case time complexity of the problem of finding pseudoperipheral nodes.
论文关键词：
论文评审过程：Received 13 December 1982, Revised 14 September 1983, Available online 2 December 2003.
论文官网地址：https://doi.org/10.1016/0022-0000(84)90012-6
