The minimum number of edges in graphs with prescribed paths

DOI10.1007/BF01776581zbMath0387.94045MaRDI QIDQ4168536

Nicholas J. Pippenger

Publication date: 1979

Published in: Mathematical Systems Theory (Search for Journal in Brave)

zbMATH Keywords

CONTINUED FRACTION EXPANSIONDIRECT GRAPHS WITH PRESCRIBED PATHSDIRECTED PATHINPUTMATRICESMINIMUM NUMBER OF EDGESOUTP

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Continued fractions and generalizations (11J70) Applications of graph theory to circuits and networks (94C15) Directed graphs (digraphs), tournaments (05C20)

Related Items

On the Complexity of Multivalued Logic Functions over Some Infinite Basis ⋮ Rectifier Circuits of Bounded Depth ⋮ On another Boolean matrix ⋮ Attacking and Defending the McEliece Cryptosystem ⋮ On the complexity of matrix reduction over finite fields ⋮ On Bellman's and Knuth's problems and their generalizations

Cites Work

• On another Boolean matrix
• On the Evaluation of Powers and Monomials
• Unnamed Item