Author:
Barman Sambhu Charan,Mondal Sukumar,Pal Madhumangal
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics
Reference16 articles.
1. Chen, C.C.Y., Das, S.K.: Breadth-first traversal of trees and integer sorting in parallel. Inf. Process. Lett. 41, 39–49 (1992)
2. Deo, N.: Graph Theory with Applications to Engineering and Computer Science. Prentice Hall, New York (1990)
3. Eppstein, D.: Finding the k shortest paths. SIAM J. Comput. 28, 652–673 (1998)
4. Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, San Diego (1980)
5. Krasikov, I., Noble, S.D.: Finding next-to-shortest paths in a graph. Inf. Process. Lett. 92, 117–119 (2004)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Computation of diameter, radius and center of permutation graphs;Discrete Mathematics, Algorithms and Applications;2021-12-06
2. Minimum r-neighborhood covering set of permutation graphs;Discrete Mathematics, Algorithms and Applications;2021-01-25
3. An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs;Asian-European Journal of Mathematics;2020-03-25
4. An Introduction to Intersection Graphs;Handbook of Research on Advanced Applications of Graph Theory in Modern Society;2020
5. An optimal algorithm to find minimum k-hop dominating set of interval graphs;Discrete Mathematics, Algorithms and Applications;2019-04