STACS 2004
From MaRDI portal
Publication:5309714
DOI10.1007/B96012zbMATH Open1122.68458OpenAlexW4236485840MaRDI QIDQ5309714
Publication date: 1 October 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b96012
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
Computing single source shortest paths using single-objective fitness ⋮ Simple linear time approximation algorithm for betweenness ⋮ Simpler computation of single-source shortest paths in linear average time ⋮ Title not available (Why is that?)
This page was built for publication: STACS 2004
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5309714)
