Waterfall Network is a layer-1 protocol that implements a Directed Acyclic Graph (DAG) as its foundational ledger. A DAG is a ...

In order to achieve resilient multipath routing, we introduce the concept of independent directed acyclic graphs (IDAGs) in this paper. Link-independent (node-independent) DAGs satisfy the property ...

By making progress on one of the most intriguing and well-studied graph theoretic problems, the paper proposes a new way of designing efficient graph algorithms that will go significantly beyond ...

In pulse deinterleaving, the search procedure may fail because of missing pulses and pulse repetition interval (PRI) jitter. This study proposes a search method based on the directed acyclic graph ...

In such cases, the fastest known shortest-path algorithm doesn’t work. For decades, fast algorithms for finding shortest paths on negative-weight graphs have remained elusive.