Visually Comparing Graph Vertex Ordering Algorithms through Geometrical and Topological Approaches

Authors

DOI:

https://doi.org/10.5753/jbcs.2026.5851

Keywords:

Visualization-assisted analysis, Vertex Ordering, Quality Metrics

Abstract

Graph vertex ordering is a resource widely employed in spatial data analysis, particularly in the urban analytics context, where street graphs are frequently used as spatial discretization for modeling and simulation. Vertex ordering is also important for visualization purposes, as many methods require the vertices to be arranged and displayed in a well-defined order to enable the visual identification of non-trivial patterns. The primary goal of vertex ordering methods is to find an ordering that preserves neighborhood relations. However, the structural complexity of graphs employed in real-world applications leads to unavoidable distortions in the ordering process. Therefore, comparing different vertex ordering methods is fundamental to enable effective analysis and selection of the most appropriate method in each application. Although several metrics have been proposed to assess spatial vertex ordering, they typically focus on measuring the quality of the ordering globally. Global ordering assessment does not enable the analysis and identification of locations where distortions are more pronounced, hampering the analytical process. Visual evaluation of the vertex ordering mechanisms is particularly valuable in this context, as it allows analysts to distinguish between methods based on their performance within a single visualization, assess distortions, identify regions with anomalous behavior, and, in urban contexts, explain spatial inconsistencies in the ordering. This work introduces a visualization-assisted tool to assess vertex ordering techniques, having urban analytics as the application focus. Specifically, we evaluate geometric and topological vertex ordering approaches using urban street graphs as the basis for comparisons. The visual tool builds upon existing and newly proposed metrics, which are validated through experiments on urban data from multiple cities, demonstrating that the proposed methodology is effective in assisting users in selecting a suitable vertex ordering technique, fine-tuning hyperparameters, and identifying regions with high ordering distortions.

Downloads

Download data is not yet available.

References

Atkins, J. E., Boman, E. G., and Hendrickson, B. (1998). A spectral algorithm for seriation and the consecutive ones problem. SIAM J. on Computing, 28(1):297-310. DOI: 10.1137/s0097539795285771.

Behrisch, M., Bach, B., Henry Riche, N., Schreck, T., and Fekete, J.-D. (2016). Matrix reordering methods for table and network visualization. Comp. Graph. Forum, 35(3):693-716. DOI: 10.1111/cgf.12935.

Berger, M., Nonato, L. G., Pascucci, V., and Silva, C. T. (2010). Fiedler trees for multiscale surface analysis. Computers & Graphics, 34(3):272-281. DOI: 10.1016/j.cag.2010.03.009.

Buchmüller, J., Jäckle, D., Cakmak, E., Brandes, U., and Keim, D. A. (2018). Motionrugs: Visualizing collective trends in space and time. IEEE TVCG, 25(1):76-86. DOI: 10.1109/TVCG.2018.2865049.

Camacho, D., Panizo-LLedot, A., Bello-Orgaz, G., Gonzalez-Pardo, A., and Cambria, E. (2020). The four dimensions of social network analysis: An overview of research methods, applications, and software tools. Information Fusion, 63:88-120. DOI: 10.1016/j.inffus.2020.05.009.

Chau, S. L., Cucuringu, M., and Sejdinovic, D. (2022). Spectral ranking with covariates. In MLKDD, pages 70-86. Springer. DOI: 10.1007/978-3-031-26419-1_5.

Chung, F. R. and Graham, F. C. (1997). Spectral graph theory. Number 92. Amer. Math. Soc.. DOI: 10.1090/cbms/092.

Concas, A., Fenu, C., Rodriguez, G., and Vandebril, R. (2023). The seriation problem in the presence of a double fiedler value. Numerical Algorithms, 92(1):407-435. DOI: 10.1007/s11075-022-01461-1.

contributors, O. (2017). Planet dump retrieved from https://planet.osm.org. Available at:[link].

Costa, L. d. F. and Tokuda, E. K. (2022). A similarity approach to cities and features. The European Physical Journal B, 95(9):155. DOI: 10.1140/epjb/s10051-022-00420-y.

Cuthill, E. and McKee, J. (1969). Reducing the bandwidth of sparse symmetric matrices. In ACM National Conf., pages 157-172. DOI: 10.1145/800195.805928.

da Fontoura Costa, L. (2023). Matrix and spectral similarity networks. Available at:[link] working paper or preprint.

Dong, W., Moses, C., and Li, K. (2011). Efficient k-nearest neighbor graph construction for generic similarity measures. In Int. Conf. WWW, pages 577-586. DOI: 10.1145/1963405.1963487.

Elmqvist, N., Do, T., Goodell, H., Henry, N., and Fekete, J. (2008). Zame: Interactive large-scale graph visualization. In PacificVis, pages 215-222. DOI: 10.1109/pacificvis.2008.4475479.

Franke, M., Martin, H., Koch, S., and Kurzhals, K. (2021). Visual analysis of spatio-temporal phenomena with 1d projections. In Com. Graph. Forum, volume 40, pages 335-347. DOI: 10.1111/cgf.14311.

Garcia-Zanabria, G., Silveira, J., Poco, J., Paiva, A., Nery, M. B., Silva, C. T., Adorno, S., and Nonato, L. G. (2019). Crimanalyzer: Understanding crime patterns in são paulo. IEEE TVCG, 27(4):2313-2328. DOI: 10.1109/tvcg.2019.2947515.

Hamer, R. M. and Young, F. W. (2013). Multidimensional scaling: History, theory, and applications. Psychology Press. DOI: 10.2307/2348396.

Harel, D. and Koren, Y. (2002). Graph drawing by high-dimensional embedding. In Graph Drawing, pages 207-219. Springer. DOI: 10.1007/3-540-36151-0_20.

Kaveh, A. and Bondarabady, H. R. (2002). A multi-level finite element nodal ordering using algebraic graph theory. Finite Elem. Anal. Design, 38(3):245-261. DOI: 10.1016/s0168-874x(01)00062-2.

Luo, D., Nie, F., Huang, H., and Ding, C. H. (2011). Cauchy graph embedding. In ICML, pages 553-560. Book.

Mafteiu-Scai, L. O. (2014). The bandwidths of a matrix: a survey of algorithms. Annals of West Univ. of Timisoara-Math. and Comp. Science, 52(2):183-223. DOI: 10.2478/awutm-2014-0019.

Mark, D. M. (1990). Neighbor-based properties of some orderings of two-dimensional space. Geogr. Anal., 22(2):145-157. DOI: 10.1111/j.1538-4632.1990.tb00201.x.

McInnes, L., Healy, J., Saul, N., and Großberger, L. (2018). Umap: Uniform manifold approximation and projection. J. of Open Source Soft., 3(29):861. DOI: 10.21105/joss.00861.

Mokbel, M. F., Aref, W. G., and Kamel, I. (2003). Analysis of multi-dimensional space-filling curves. GeoInformatica, 7:179-209. DOI: 10.1023/a:1025196714293.

Morton, G. M. (1966). A computer oriented geodetic data base and a new technique in file sequencing.(1966). IBM, Ottawa, Canada. Book.

Mueller, C., Martin, B., and Lumsdaine, A. (2007). A comparison of vertex ordering algorithms for large graph visualization. In Int. Asia-Pacific Symp. on Vis., pages 141-148. IEEE. DOI: 10.1109/apvis.2007.329289.

Niermann, S. (2005). Optimizing the ordering of tables with evolutionary computation. The American Statistician, 59(1):41-46. DOI: 10.1198/000313005x22770.

Nonato, L. G. and Aupetit, M. (2018). Multidimensional projection for visual analytics: Linking techniques with distortions, tasks, and layout enrichment. IEEE TVCG, 25(8):2650-2673. DOI: 10.1109/tvcg.2018.2846735.

Pan, X., Cai, X., Song, K., Baker, T., Gadekallu, T. R., and Yuan, X. (2022). Location recommendation based on mobility graph with individual and group influences. IEEE TITS (online first). DOI: 10.1109/tits.2022.3149869.

Paulovich, F. V., Toledo, F. M., Telles, G. P., Minghim, R., and Nonato, L. G. (2012). Semantic wordification of document collections. Comp. Graph. Forum, 31(3pt3):1145-1153. DOI: 10.1111/j.1467-8659.2012.03107.x.

Robinson, W. S. (1951). A method for chronologically ordering archaeological deposits. Amer. Antiquity, 16(4):293-301. DOI: 10.2307/276978.

Rosen, R. (1968). Matrix bandwidth minimization. In ACM National Conf., pages 585-595. DOI: 10.1145/800186.810622.

Salinas, K., Barella, V., Vieira, T., and Nonato, L. G. (2024). A visual methodology to assess spatial graph vertex ordering algorithms. In 2024 37th SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI), pages 01-06. IEEE. DOI: 10.1109/sibgrapi62404.2024.10716318.

Salinas, K., Gonçalves, T., Barella, V., Vieira, T., and Nonato, L. G. (2022). Cityhub: A library for urban data integration. In SIBGRAPI, volume 1, pages 43-48. IEEE. DOI: 10.1109/sibgrapi55357.2022.9991775.

Santos, T. P., Souza, J. M. S., Vieira, T., and Nonato, L. G. (2024). Space-time urban explorer: A visual tool for exploring spatiotemporal crime and patrolling data. In 2024 37th SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI), pages 1-6. IEEE. DOI: 10.1109/sibgrapi62404.2024.10716319.

Van der Maaten, L. and Hinton, G. (2008). Visualizing data using t-sne. J. of Mach. Learning Res., 9(11). Available at:[link].

Wei, H., Yu, J. X., Lu, C., and Lin, X. (2016). Speedup graph processing by graph ordering. In Int. Conf. on Management of Data, pages 1813-1828. DOI: 10.1145/2882903.2915220.

Zhang, S., Tong, H., Xu, J., and Maciejewski, R. (2019). Graph convolutional networks: a comprehensive review. Computational Social Networks, 6(1):1-23. DOI: 10.1186/s40649-019-0069-y.

Zhou, L., Johnson, C. R., and Weiskopf, D. (2020). Data-driven space-filling curves. IEEE TVCG, 27(2):1591-1600. DOI: 10.1109/tvcg.2020.3030473.

Downloads

Published

2026-03-16

How to Cite

Salinas, K. V., Barella, V., Vieira, T., & Nonato, L. G. (2026). Visually Comparing Graph Vertex Ordering Algorithms through Geometrical and Topological Approaches. Journal of the Brazilian Computer Society, 32(1), 363–373. https://doi.org/10.5753/jbcs.2026.5851

Issue

Section

Regular Issue