Browsing by Author "Wagner, Donald K."

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item
    A Note on Detecting Simple Redundancies in Linear Systems
    (1986-06) Bixby, R.E.; Wagner, Donald K.
    Two efficient algorithms are presented that, for a given linear system Ax=b, eliminate equations that are nonzero multiples of other equations. The second algorithm runs in linear time when the entries of A are +1, -1, or 0.
  • Thumbnail Image
    Item
    An Almost Linear-Time Algorithm for Graph Realization
    (1985-03) Bixby, Robert E.; Wagner, Donald K.
    Given a {0,1}-matrix M, the graph realization problem for M is to find a tree such that the columns of M are incidence vectors of paths in T, or to show that no such T exists. An algorithm is presented for this problem the time complexity of which is very nearly linear in the number of ones in M.