Parallel Algorithm to find Integer k where a given Well-Distributed Graph is k-Metric Dimensional
- Title
- Parallel Algorithm to find Integer k where a given Well-Distributed Graph is k-Metric Dimensional
- Description
- Advances in Intelligent Systems and Computing Vol.1333 AISC pp.145-153
- Creator
- Chelladurai X.; Kureethara J.V.
- Source
- <a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85104776016&doi=10.1007%2f978-981-33-6966-5_15&partnerID=40&md5=0b138839b133c716a59119e3f63b5318" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85104776016&doi=10.1007%2f978-981-33-6966-5_15&partnerID=40&md5=0b138839b133c716a59119e3f63b5318</a>
- Date
- 2021-01-01
Collection
Citation
Chelladurai X.; Kureethara J.V., “Parallel Algorithm to find Integer k where a given Well-Distributed Graph is k-Metric Dimensional,” CHRIST (Deemed To Be University) Institutional Repository, accessed February 8, 2025, https://archives.christuniversity.in/items/show/10951.