The minimum number of edges in graphs with prescribed paths
From MaRDI portal
Publication:4168536
DOI10.1007/BF01776581zbMath0387.94045MaRDI QIDQ4168536
Publication date: 1979
Published in: Mathematical Systems Theory (Search for Journal in Brave)
CONTINUED FRACTION EXPANSION; DIRECT GRAPHS WITH PRESCRIBED PATHS; DIRECTED PATH; INPUT; MATRICES; MINIMUM NUMBER OF EDGES; OUTP
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
11J70: Continued fractions and generalizations
94C15: Applications of graph theory to circuits and networks
05C20: Directed graphs (digraphs), tournaments
Related Items
On the Complexity of Multivalued Logic Functions over Some Infinite Basis, Rectifier Circuits of Bounded Depth, On another Boolean matrix, On Bellman's and Knuth's problems and their generalizations, On the complexity of matrix reduction over finite fields, Attacking and Defending the McEliece Cryptosystem
Cites Work