Access

You are not currently logged in.

Access JSTOR through your library or other institution:

login

Log in through your institution.

An Almost Linear-Time Algorithm for Graph Realization

Robert E. Bixby and Donald K. Wagner
Mathematics of Operations Research
Vol. 13, No. 1 (Feb., 1988), pp. 99-123
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/3689867
Page Count: 25
  • Download ($30.00)
  • Cite this Item
An Almost Linear-Time Algorithm for Graph Realization
Preview not available

Abstract

Given a {0, 1}-matrix M, the graph-realization problem for M is to find a tree T 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.

Page Thumbnails

  • Thumbnail: Page 
99
    99
  • Thumbnail: Page 
100
    100
  • Thumbnail: Page 
101
    101
  • Thumbnail: Page 
102
    102
  • Thumbnail: Page 
103
    103
  • Thumbnail: Page 
104
    104
  • Thumbnail: Page 
105
    105
  • Thumbnail: Page 
106
    106
  • Thumbnail: Page 
107
    107
  • Thumbnail: Page 
108
    108
  • Thumbnail: Page 
109
    109
  • Thumbnail: Page 
110
    110
  • Thumbnail: Page 
111
    111
  • Thumbnail: Page 
112
    112
  • Thumbnail: Page 
113
    113
  • Thumbnail: Page 
114
    114
  • Thumbnail: Page 
115
    115
  • Thumbnail: Page 
116
    116
  • Thumbnail: Page 
117
    117
  • Thumbnail: Page 
118
    118
  • Thumbnail: Page 
119
    119
  • Thumbnail: Page 
120
    120
  • Thumbnail: Page 
121
    121
  • Thumbnail: Page 
122
    122
  • Thumbnail: Page 
123
    123