Finding a maximum weight triangle in n 3-Δ time, with applications
From MaRDI portal
Publication:2931387
DOI10.1145/1132516.1132550zbMath1301.05342MaRDI QIDQ2931387
R. Ryan Williams, Virginia Vassilevska Williams
Publication date: 25 November 2014
Published in: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1132516.1132550
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
68W20: Randomized algorithms
05C22: Signed and weighted graphs
Related Items
Unnamed Item, Improved Time Bounds for All Pairs Non-decreasing Paths in General Digraphs, Hamming Distance Completeness, Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs, Elastic-Degenerate String Matching via Fast Matrix Multiplication, All-pairs bottleneck paths in vertex weighted graphs, Efficient approximation algorithms for shortest cycles in undirected graphs, Extreme witnesses and their applications