The problem of graph Reachability is to decide whether there is a path from one vertice to another in a given graph . In this paper, we study theReachability problem on three distinct graph families — intersection graphs ofJordan regions, unit contact disk graphs (penny graphs), and chordal graphs . In order to obtain these results, we use the graphseparator of these graphs effectively and design space-efficient algorithms to find such separators . The constructions of the separators presented here can beof independent interest .
Author(s) : Sujoy Bhore, Rahul JainLinks : PDF - Abstract
Code :
Keywords : graphs - graph - problem - efficient - reachability -
- fast.ai Machine Learning
- Google Cloud Professional Data Engineer Specialization
- AI for Everyone by Andrew Ng
- Mathematics for Machine Learning by Marc Peter Deisenroth, A. Aldo Faisal and Cheng Soon Ong
- Introduction to Data Science in Python on Coursera
- 3Blue1Brown
- AI Programming with Python
- Kaggle Learning