A compact form of assignment of all nonexcessive paths in a digraph
From MaRDI portal
Publication:1914365
zbMath0847.68083MaRDI QIDQ1914365
Publication date: 12 June 1996
Published in: Automation and Remote Control (Search for Journal in Brave)
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)
This page was built for publication: A compact form of assignment of all nonexcessive paths in a digraph