Approximate Distance Oracle in O(n2) Time and O(n) Space for Chordal Graphs

DOI10.1007/978-3-319-15612-5_9zbMath1432.68104OpenAlexW147048774MaRDI QIDQ5176575

G. Ramakrishna, Gaurav Singh, N. S. Narayanaswamy

Publication date: 27 February 2015

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-15612-5_9

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Approximation algorithms (68W25)

Related Items (2)

Unnamed Item ⋮ Unnamed Item

This page was built for publication: Approximate Distance Oracle in O(n2) Time and O(n) Space for Chordal Graphs