Improved upper and lower bound techniques for monotone switching networks for directed connectivity
Data Structures and Algorithms
2013-12-17 v2 Networking and Internet Architecture
Abstract
In this paper, we analyze the monotone space of complexity of directed connectivity for a large class of input graphs using the switching network model. The upper and lower bounds we obtain are a significant generalization of previous results and the proofs involve several completely new techniques and ideas.
Cite
@article{arxiv.1302.3726,
title = {Improved upper and lower bound techniques for monotone switching networks for directed connectivity},
author = {Aaron Potechin},
journal= {arXiv preprint arXiv:1302.3726},
year = {2013}
}
Comments
48 pages, 0 figures