Multilevel algorithms for linear ordering problems

DOI10.1145/1412228.1412232MaRDI QIDQ5406172zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Ilya Safro, Dorit Ron, Achi Brandt

Publication date 1 April 2014

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1412228.1412232

zbMATH Keywords

algebraic multigridlinear orderingmultilevel algorithm

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph theory (including graph drawing) in computer science (68R10) Symbolic computation and algebraic computation (68W30) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)

Recommendations

• Multilevel MLA algorithm and its application in graph partitioning problem
• scientific article; zbMATH DE number 1953102
• Graph minimum linear arrangement by multilevel weighted edge contractions
• Linear time algorithms to solve the linear ordering problem for oriented tree based graphs
• Efficient local search algorithms for the linear ordering problem

Cited in

(15)

• Efficient algorithms for single- and two-layer linear placement of parallel graphs
• Ordering algorithms for irreducible sparse linear systems
• An ordering linear unification algorithm
• Multilevel graph partitioning for three-dimensional discrete fracture network flow simulations
• Linear time algorithms to solve the linear ordering problem for oriented tree based graphs
• Advanced coarsening schemes for graph partitioning
• Multilevel MLA algorithm and its application in graph partitioning problem
• scientific article; zbMATH DE number 1953102 (Why is no real title available?)
• Multilevel hybrid spectral element ordering algorithms
• Aggregative coarsening for multilevel hypergraph partitioning
• A Multilevel Algorithm for the Minimum 2-sum Problem
• Graph minimum linear arrangement by multilevel weighted edge contractions
• Multiscale approach for the network compression-friendly ordering
• Visualizing large graphs
• Bandwidth vs BFS width in matrix reordering, graph reconstruction, and graph drawing

This page was built for publication: Multilevel algorithms for linear ordering problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5406172)