Access

You are not currently logged in.

Access JSTOR through your library or other institution:

login

Log in through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Journal Article

Algorithm AS 140: Clustering the Nodes of a Directed Graph

Gary W. Oehler
Journal of the Royal Statistical Society. Series C (Applied Statistics)
Vol. 28, No. 2 (1979), pp. 206-214
Published by: Wiley for the Royal Statistical Society
DOI: 10.2307/2346750
Stable URL: http://www.jstor.org/stable/2346750
Page Count: 9

You can always find the topics here!

Topics: Integers, Matrices, Subroutines, Algorithms, Applied statistics, Statism, Eigenvectors
Were these topics helpful?
See somethings inaccurate? Let us know!

Select the topics that are inaccurate.

Cancel
  • Read Online (Free)
  • Download ($29.00)
  • Subscribe ($19.50)
  • Add to My Lists
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Algorithm AS 140: Clustering the Nodes of a Directed Graph
Preview not available

Page Thumbnails

  • Thumbnail: Page 
206
    206
  • Thumbnail: Page 
207
    207
  • Thumbnail: Page 
208
    208
  • Thumbnail: Page 
209
    209
  • Thumbnail: Page 
210
    210
  • Thumbnail: Page 
211
    211
  • Thumbnail: Page 
212
    212
  • Thumbnail: Page 
213
    213
  • Thumbnail: Page 
214
    214