Development of Theoretical Foundations for Description and Analysis of Discrete Information Systems. Volume II. Mathematics.
MASSACHUSETTS COMPUTER ASSOCIATES INC WAKEFIELD
Pagination or Media Count:
Contents Marked directed graphs Integer programming theorems for oriented graphoids The path graphoid of a graph and its applications to network theory The vertex graphoid of a bipartite graph and a sufficient condition for total unimodularity Deadlocks in Petri nets A sufficient condition for a matrix to be totally unimodular.
- Operations Research