An Almost Linear-Time Algorithm for Graph Realization
| dc.contributor.author | Bixby, Robert E. | en_US |
| dc.contributor.author | Wagner, Donald K. | en_US |
| dc.date.accessioned | 2018-06-18T17:24:30Z | en_US |
| dc.date.available | 2018-06-18T17:24:30Z | en_US |
| dc.date.issued | 1985-03 | en_US |
| dc.date.note | March 1985 | en_US |
| dc.description.abstract | 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. | en_US |
| dc.format.extent | 42 pp | en_US |
| dc.identifier.citation | Bixby, 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>. | en_US |
| dc.identifier.digital | TR85-02 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1911/101579 | en_US |
| dc.language.iso | eng | en_US |
| dc.title | An Almost Linear-Time Algorithm for Graph Realization | en_US |
| dc.type | Technical report | en_US |
| dc.type.dcmi | Text | en_US |
Files
Original bundle
1 - 1 of 1