3 citations · 3 across the 1 of their papers we have counts for
2 papers
cs.DC2018★ 3 cited
The Sparsest Additive Spanner via Multiple Weighted BFS Trees
Keren Censor-Hillel, Ami Paz, Noam Ravid
Spanners are fundamental graph structures that sparsify graphs at the cost of small stretch. In particular, in recent years, many sequential algorithms constructing additive all-pa…
cs.DS2017
Ranked Enumeration of Minimal Triangulations
Noam Ravid, Dori Medini, Benny Kimelfeld
A tree decomposition of a graph facilitates computations by grouping vertices into bags that are interconnected in an acyclic structure, hence their importance in a plethora of pro…