I started to read about distance oracle but I don’t understand the term ‘size’ of distance oracle. What is it?
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I started to read about distance oracle but I don’t understand the term ‘size’ of distance oracle. What is it?
After digging a bit in several articles of the subject it seems that it refers to the amount of space the oracle stores to be able to efficiently answer queries of type “what is the distance between the vertices u and v in graph G.
For instance, the stretch-3 oracle of Thorp & Zwick (2005) uses memory of O(|E| + (|V|^2)/|L|). Such that |L| is number of landmark vertices.
Each oracle has it’s efficiency and hence maybe stores other elements of the graph to be able to answer those queries.