Scalable Algorithms for Multiple Network Alignment

DOI10.1137/20M1345876zbMath1470.05154arXiv1809.08198OpenAlexW3188418791MaRDI QIDQ5009904

David F. Gleich, Huda Nassar, Georgios Kollias, Ananth Grama

Publication date: 9 August 2021

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1809.08198

zbMATH Keywords

low-rank tensornetwork alignmentmultiple network alignment\(K\)-dimensional matching\(K\)-partite matching

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Dominant Z-Eigenpairs of Tensor Kronecker Products Decouple

Uses Software

• GHOST
• IsoRank
• IsoRankN
• PrimAlign
• L-GRAAL

Cites Work

• Unnamed Item
• Maximum bounded 3-dimensional matching is MAX SNP-complete
• Lagrangian relaxations for multiple network alignment
• Bounded-rank tensors are defined in bounded degree
• PageRank Beyond the Web
• Fast Katz and Commuters: Efficient Estimation of Social Relatedness in Large Networks
• Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
• Approximation Algorithms for Some Graph Partitioning Problems
• Reducibility among Combinatorial Problems
• The complexity of theorem-proving procedures
• A Survey on PageRank Computing
• Two New Inequalities

This page was built for publication: Scalable Algorithms for Multiple Network Alignment