Finding heaviest H -subgraphs in real weighted graphs, with applications
From MaRDI portal
Publication:2930324
DOI10.1145/1798596.1798597zbMath1300.05307OpenAlexW2066367171MaRDI QIDQ2930324
Raphael Yuster, R. Ryan Williams, Virginia Vassilevska Williams
Publication date: 18 November 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1798596.1798597
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Quantum and approximation algorithms for maximum witnesses of Boolean matrix products, Extreme Witnesses and Their Applications, Induced subgraph isomorphism: are some patterns substantially easier than others?, Counting Homomorphic Cycles in Degenerate Graphs, Computing the rooted triplet distance between galled trees by counting triangles, Fast monotone summation over disjoint sets, On minimum witnesses for Boolean matrix multiplication, Extreme witnesses and their applications, Sequential Monte Carlo for maximum weight subgraphs with application to solving image jigsaw puzzles
