Comment on Breaking the Sorting Barrier for Directed Single-Source Shortest PathsparentComments−MarkusQ1yDegree less than 6? If m < 3n that means there are three times as many edges as nodes, and each edge connect to two vertices.So 2d square latices would still benefit.But yeah, not a total domination.
Comments
Degree less than 6? If m < 3n that means there are three times as many edges as nodes, and each edge connect to two vertices.
So 2d square latices would still benefit.
But yeah, not a total domination.