Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with series-parallel:
TR08-110 | 19th November 2008
Chris Calabro

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 original output with ≥ m edges
- the larger ... more >>>

ISSN 1433-8092 | Imprint