A Lower Bound on the Size of Series-Parallel Graphs Dense in Long Paths

Chris Calabro. A Lower Bound on the Size of Series-Parallel Graphs Dense in Long Paths. Electronic Colloquium on Computational Complexity (ECCC), 15(110), 2008. [doi]

Abstract

Abstract is missing.