Maintaining chordal graphs dynamically: improved upper and lower bounds
From MaRDI portal
Publication:1625138
DOI10.1007/978-3-319-90530-3_4zbMath1484.68148OpenAlexW2800649604MaRDI QIDQ1625138
Srinivasa Rao Satti, Venkatesh Raman, Niranka Banerjee
Publication date: 28 November 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-90530-3_4
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (1)
This page was built for publication: Maintaining chordal graphs dynamically: improved upper and lower bounds
