New re-ordering algorithm for skyline method

Takeo Taniguchi, Akira Soga

Research output: Contribution to journalReview article

Abstract

The minimum profile problem of a sparse matrix is theoretically treated, and by using the results a new profile reducer is proposed. Numerical experiments clarify that the new reducer is effective for the node re-ordering of graphs with rather complex configuration. Further considerations on the proposed method and numerical error of the skyline method are also given.

Original languageEnglish
Pages (from-to)107-113
Number of pages7
JournalEngineering Computations
Volume2
Issue number2
DOIs
Publication statusPublished - Feb 1 1985

    Fingerprint

ASJC Scopus subject areas

  • Software
  • Engineering(all)
  • Computer Science Applications
  • Computational Theory and Mathematics

Cite this