Bixby, Robert E.Wagner, Donald K.2018-06-182018-06-181985-03Bixby, Robert E. and Wagner, Donald K.. "An Almost Linear-Time Algorithm for Graph Realization." (1985) <a href="https://hdl.handle.net/1911/101579">https://hdl.handle.net/1911/101579</a>.https://hdl.handle.net/1911/101579Given 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.42 ppengTechnical reportTR85-02