Article

A Multi-scale Algorithm for the Linear Arrangement Problem

Authors:

Yehuda Koren,

David HarelAuthors Info & Claims

WG '02: Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science

Pages 296 - 309

Published: 13 June 2002 Publication History

Abstract

Finding a linear ordering of the vertices of a graph is a common problem arising in diverse applications. In this paper we present a linear-time algorithm for this problem, based on the multi-scale paradigm. Experimental results are similar to those of the best known approaches, while the running time is significantly better, enabling it to deal with much larger graphs. The paper contains a general multi-scale construction, which may be used for a broader range of ordering problems.

References

[1]

J. E. Atkins, E. G. Boman and B. Hendrickson, "A Spectral Algorithm for Seriation and the Consecutive Ones Problem", SIAM Journal on Computing 28 (1998), 297-310.

Crossref

Google Scholar

[2]

S. T. Barnard and H. D. Simon, "A Fast Multilevel Implementation of Recursive Spectral Bisection for Partitioning Unstructured Problems", Concurrency: Practice & Experience 6 (1994), 101-117.

Google Scholar

[3]

J. Diaz, J. Petit and M. Serna, "A Survey on Graph Layout Problems", Technical report LSI-00-61-R, Universitat Politècnica de Catalunya, Departament de Llenguatges i Sistemes Informàtics, 2000.

Google Scholar

[4]

M. R. Garey and D. S. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness , W. H. Freeman, 1979.

Crossref

Google Scholar

[5]

D. Harel and Y. Koren, "A Fast Multi-Scale Method for Drawing Graphs Nicely", Proceedings of Graph Drawing'00 , Lecture Notes in Computer Science, Vol. 1984, Springer Verlag, pp. 183-196, 2000.

Crossref

Google Scholar

[6]

M. Juvan and B. Mohar, "Optimal Linear Labelings and Eigenvalues of Graphs", Discrete Applied Math . 36 (1992), 153-168.

Crossref

Google Scholar

[7]

G. Karypis and V. Kumar, "A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs", SIAM Journal on Scientific Computing 20 (1999), 359-392.

Crossref

Google Scholar

[8]

S. Kirkpatrick J. Gelatt and M.P. Vecchi, "Optimization by Simulated Annealing", Science 220 (1983), 671-680.

Google Scholar

[9]

Y. Koren, L. Carmel and D. Harel "ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs", Technical Report MCS01-17, Faculty of Mathematics and Computer Science, The Weizmann Institute of Science, 2001. To appear in Proc. IEEE Information Visualization 2002.

Crossref

Google Scholar

[10]

Y. Koren and D. Harel "Multi-Scale Algorithm for the Linear Arrangement Problem", Technical Report MCS02-04, Faculty of Mathematics and Computer Science, The Weizmann Institute of Science, 2002. Available at: www.wisdom.weizmann.ac.il/reports.html

Google Scholar

[11]

J. Petit, "Experiments on the Minimum Linear Arrangement Problem", Technical report LSI- 01-7-R, Universitat Politècnica de Catalunya, Departament de Llenguatges i Sistemes Informàtics, 2001.

Google Scholar

[12]

S. H. Teng, "Coarsening, Sampling, and Smoothing: Elements of the Multilevel Method", Algorithms for Parallel Processing , IMA Volumes in Mathematics and its Applications, Vol. 105, Springer Verlag, pp. 247-276, 1999.

Google Scholar

[13]

C. Walshaw, "Multilevel Refinement for Combinatorial Optimisation Problems", Technical Report 01/IM/73, Comp. Math. Sci., Univ. Greenwich, London, UK, 2001.

Google Scholar

Cited By

View all

Behrisch MBach BHenry Riche NSchreck TFekete J(2016)Matrix Reordering Methods for Table and Network VisualizationComputer Graphics Forum10.5555/3071534.307159535:3(693-716)Online publication date: 1-Jun-2016
https://dl.acm.org/doi/10.5555/3071534.3071595
Wei HYu JLu CLin XÖzcan FKoutrika GMadden S(2016)Speedup Graph Processing by Graph OrderingProceedings of the 2016 International Conference on Management of Data10.1145/2882903.2915220(1813-1828)Online publication date: 26-Jun-2016
https://dl.acm.org/doi/10.1145/2882903.2915220
Sallaberry AMuelder CMa K(2012)Clustering, visualizing, and navigating for large dynamic graphsProceedings of the 20th international conference on Graph Drawing10.1007/978-3-642-36763-2_43(487-498)Online publication date: 19-Sep-2012
https://dl.acm.org/doi/10.1007/978-3-642-36763-2_43
Show More Cited By

Index Terms

A Multi-scale Algorithm for the Linear Arrangement Problem
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Graph algorithms

Index terms have been assigned to the content through auto-classification.

Recommendations

A linear time algorithm for liar's domination problem in proper interval graphs

Let G=(V,E) be a graph without isolated vertices and having at least 3 vertices. A set L@?V(G) is a liar@?s dominating set if (1) |N"G[v]@?L|>=2 for all v@?V(G), and (2) |(N"G[u]@?N"G[v])@?L|>=3 for every pair u,v@?V(G) of distinct vertices in G, where ...
A linear time algorithm for the induced disjoint paths problem in planar graphs

In this paper, we consider a problem which we call the induced disjoint paths problem (IDPP) for planar graphs. We are given a planar graph G and a collection of vertex pairs {(s"1,t"1),...,(s"k,t"k)}. The objective is to find k paths P"1,...,P"k such ...
A linear-time algorithm for clique-coloring problem in circular-arc graphs

A maximal clique of G is a clique not properly contained in any other clique. A k-clique-coloring of a graph G is an assignment of k colors to the vertices of G such that no maximal clique with at least two vertices is monochromatic. The smallest ...

Comments

Information & Contributors

Information

Published In

WG '02: Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science

June 2002

420 pages

ISBN:3540003312

Editor:
Ludek Kucera

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 13 June 2002

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

13
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 09 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Behrisch MBach BHenry Riche NSchreck TFekete J(2016)Matrix Reordering Methods for Table and Network VisualizationComputer Graphics Forum10.5555/3071534.307159535:3(693-716)Online publication date: 1-Jun-2016
https://dl.acm.org/doi/10.5555/3071534.3071595
Wei HYu JLu CLin XÖzcan FKoutrika GMadden S(2016)Speedup Graph Processing by Graph OrderingProceedings of the 2016 International Conference on Management of Data10.1145/2882903.2915220(1813-1828)Online publication date: 26-Jun-2016
https://dl.acm.org/doi/10.1145/2882903.2915220
Sallaberry AMuelder CMa K(2012)Clustering, visualizing, and navigating for large dynamic graphsProceedings of the 20th international conference on Graph Drawing10.1007/978-3-642-36763-2_43(487-498)Online publication date: 19-Sep-2012
https://dl.acm.org/doi/10.1007/978-3-642-36763-2_43
Sarawagi SDeshpande VKasliwal S(2009)Efficient top-k count queries over imprecise duplicatesProceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology10.1145/1516360.1516413(450-461)Online publication date: 24-Mar-2009
https://dl.acm.org/doi/10.1145/1516360.1516413
Safro IRon DBrandt A(2009)Multilevel algorithms for linear ordering problemsJournal of Experimental Algorithmics (JEA)10.1145/1412228.141223213(1.4-1.20)Online publication date: 23-Feb-2009
https://dl.acm.org/doi/10.1145/1412228.1412232
Yoon SLindstrom P(2006)Mesh Layouts for Block-Based CachesIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2006.16212:5(1213-1220)Online publication date: 1-Sep-2006
https://dl.acm.org/doi/10.1109/TVCG.2006.162
Henry NFekete J(2006)MatrixExplorerIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2006.16012:5(677-684)Online publication date: 1-Sep-2006
https://dl.acm.org/doi/10.1109/TVCG.2006.160
Safro IRon DBrandt A(2006)Graph minimum linear arrangement by multilevel weighted edge contractionsJournal of Algorithms10.1016/j.jalgor.2004.10.00460:1(24-41)Online publication date: 1-Jul-2006
https://dl.acm.org/doi/10.1016/j.jalgor.2004.10.004
Koren YHarel D(2005)One-dimensional layout optimization, with applications to graph drawing by axis separationComputational Geometry: Theory and Applications10.5555/1114727.164649532:2(115-138)Online publication date: 1-Oct-2005
https://dl.acm.org/doi/10.5555/1114727.1646495
Rodriguez-Tello EHao JTorres-Jimenez J(2005)Memetic algorithms for the MinLA problemProceedings of the 7th international conference on Artificial Evolution10.1007/11740698_7(73-84)Online publication date: 26-Oct-2005
https://dl.acm.org/doi/10.1007/11740698_7
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

A linear time algorithm for liar's domination problem in proper interval graphs

A linear time algorithm for the induced disjoint paths problem in planar graphs

A linear-time algorithm for clique-coloring problem in circular-arc graphs

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations