Vassilevska, Virginia; Williams, Ryan Finding, minimizing, and counting weighted subgraphs. (English) Zbl 1304.05102 Proceedings of the 41st annual ACM symposium on theory of computing, STOC ’09. Bethesda, MD, USA, May 31 – June 2, 2009. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-613-7). 455-464 (2009). Cited in 3 ReviewsCited in 20 Documents MSC: 05C60 Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) 05C22 Signed and weighted graphs 05C30 Enumeration in graph theory 05C69 Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) Keywords:3SUM; cliques; paths; subgraph isomorphism; weighted graph Citations:Zbl 1302.68123 PDFBibTeX XMLCite \textit{V. Vassilevska} and \textit{R. Williams}, in: Proceedings of the 41st annual ACM symposium on theory of computing, STOC '09. Bethesda, MD, USA, May 31 -- June 2, 2009. New York, NY: Association for Computing Machinery (ACM). 455--464 (2009; Zbl 1304.05102) Full Text: DOI