We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
To decide if the parameterized feedback vertex set problem in directed graph is fixed-parameter tractable is a long standing open problem. In this paper, we prove that the paramet...
We present a mathematical model for network routing based on generating paths in a consistent direction. Our development is based on an algebraic and geometric framework for defini...