Author:
Jallu Ramesh K.,Jena Sangram K.,Das Gautam K.
Publisher
Springer International Publishing
Reference16 articles.
1. Alimadadi, A., Chellali, M., Mojdeh, D.A.: Liar’s dominating sets in graphs. Discret. Appl. Math. 211, 204–210 (2016)
2. Biedl, T., Kant, G.: A better heuristic for orthogonal graph drawings. Comput. Geom. 9(3), 159–180 (1998)
3. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, Dallas (1979)
4. Hopcroft, J., Tarjan, R.: Efficient planarity testing. J. ACM (JACM) 21(4), 549–568 (1974)
5. Itai, A., Papadimitriou, C.H., Szwarcfiter, J.L.: Hamilton paths in grid graphs. SIAM J. Comput. 11(4), 676–686 (1982)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献