B.Curtis Eaves, Alan J. Hoffman, et al.
Mathematical Programming
We discuss three equivalent formulations of a theorem of Seymour on nonnegative sums of circuits of a graph, and present a different (but not shorter) proof of Seymour's resut. © 1986 Springer-Verlag New York Inc.
B.Curtis Eaves, Alan J. Hoffman, et al.
Mathematical Programming
Arlette Gaillard, Heinz Groeflin, et al.
Theoretical Computer Science
Alan J. Hoffman, Chai Wah Wu
Linear Algebra and Its Applications
Terrence R. Scott, Alan J. Hoffman
IEEE Transactions on Circuits and Systems