Bounds and algorithms for graph trusses

DOI10.7155/jgaa.00527zbMath1447.05193arXiv1806.05523OpenAlexW3014310830MaRDI QIDQ5119376

David G. Harris, Vance Faber, Paul Burkhardt

Publication date: 4 September 2020

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

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

zbMATH Keywords

fast matrix multiplication\(k\)-trusses

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Finding and counting given length cycles
• Faster multi-witnesses for Boolean matrix multiplication
• On the asymptotic complexity of rectangular matrix multiplication
• Fast algorithms for determining (generalized) core groups in social networks
• Mining Graph Patterns
• Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks
• Fast sparse matrix multiplication
• Powers of tensors and fast matrix multiplication
• Arboricity and Subgraph Listing Algorithms
• Smallest-last ordering and clustering and graph coloring algorithms
• A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
• Listing Triangles

This page was built for publication: Bounds and algorithms for graph trusses