Sciweavers

ECCC
2008
65views more  ECCC 2008»
14 years 19 days ago
A Lower Bound on the Size of Series-Parallel Graphs Dense in Long Paths
One way to quantify how dense a multidag is in long paths is to find the largest n, m such that whichever n edges are removed, there is still a path from an original input to an ...
Chris Calabro