Optimal linear labelings and eigenvalues of graphs
Discrete Applied Mathematics
A Spectral Algorithm for Seriation and the Consecutive Ones Problem
SIAM Journal on Computing
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Fast Multi-scale Method for Drawing Large Graphs
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs
INFOVIS '02 Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02)
Drawing Directed Graphs Using One-Dimensional Optimization
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Two New Heuristics for Two-Sided Bipartite Graph Drawing
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Proceedings of the 3rd ACM international workshop on Data engineering for wireless and mobile access
Combining Hierarchy and Energy Drawing Directed Graphs
IEEE Transactions on Visualization and Computer Graphics
One-dimensional layout optimization, with applications to graph drawing by axis separation
Computational Geometry: Theory and Applications
Graph minimum linear arrangement by multilevel weighted edge contractions
Journal of Algorithms
MatrixExplorer: a Dual-Representation System to Explore Social Networks
IEEE Transactions on Visualization and Computer Graphics
Mesh Layouts for Block-Based Caches
IEEE Transactions on Visualization and Computer Graphics
A Genetic Hillclimbing Algorithm for the Optimal Linear Arrangement Problem
Fundamenta Informaticae
An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
Computers and Operations Research
Efficient top-k count queries over imprecise duplicates
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
One-dimensional layout optimization, with applications to graph drawing by axis separation
Computational Geometry: Theory and Applications
Decorous Lower Bounds for Minimum Linear Arrangement
INFORMS Journal on Computing
Solving Talent Scheduling with Dynamic Programming
INFORMS Journal on Computing
A refined evaluation function for the MinLA problem
MICAI'06 Proceedings of the 5th Mexican international conference on Artificial Intelligence
Memetic algorithms for the MinLA problem
EA'05 Proceedings of the 7th international conference on Artificial Evolution
A comparison of memetic recombination operators for the MinLA problem
MICAI'05 Proceedings of the 4th Mexican international conference on Advances in Artificial Intelligence
Sybil attack detection through global topology pattern visualization
Information Visualization
SIAM Journal on Scientific Computing
A Genetic Hillclimbing Algorithm for the Optimal Linear Arrangement Problem
Fundamenta Informaticae
Clustering, visualizing, and navigating for large dynamic graphs
GD'12 Proceedings of the 20th international conference on Graph Drawing
| Hi-index | 0.00 |
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.