{"id":"https://openalex.org/W2018033449","doi":"https://doi.org/10.1137/070695149","title":"Finding a Heaviest Vertex-Weighted Triangle Is not Harder than Matrix Multiplication","display_name":"Finding a Heaviest Vertex-Weighted Triangle Is not Harder than Matrix Multiplication","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2018033449","doi":"https://doi.org/10.1137/070695149","mag":"2018033449"},"language":"en","primary_location":{"id":"doi:10.1137/070695149","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070695149","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051815913","display_name":"Artur Czumaj","orcid":"https://orcid.org/0000-0002-7743-438X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Artur Czumaj","raw_affiliation_strings":["A.Czumaj@warwick.ac.uk#TAB#"],"affiliations":[{"raw_affiliation_string":"A.Czumaj@warwick.ac.uk#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016509031","display_name":"Andrzej Lingas","orcid":"https://orcid.org/0000-0003-4998-9844"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Andrzej Lingas","raw_affiliation_strings":["Andrzej.Lingas@cs.lth.se#TAB#"],"affiliations":[{"raw_affiliation_string":"Andrzej.Lingas@cs.lth.se#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5051815913"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.09872233,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"39","issue":"2","first_page":"431","last_page":"444"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.83098304271698},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7690434455871582},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5422576069831848},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5380662679672241},{"id":"https://openalex.org/keywords/exponent","display_name":"Exponent","score":0.5294458866119385},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5129823088645935},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.5097998976707458},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48259007930755615},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4758422374725342},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.47433724999427795},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45520806312561035}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.83098304271698},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7690434455871582},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5422576069831848},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5380662679672241},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.5294458866119385},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5129823088645935},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.5097998976707458},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48259007930755615},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4758422374725342},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.47433724999427795},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45520806312561035},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/070695149","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070695149","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:wrap.warwick.ac.uk:17465","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400665","display_name":"Warwick Research Archive Portal (University of Warwick)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39555362","host_organization_name":"University of Warwick","host_organization_lineage":["https://openalex.org/I39555362"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},{"id":"pmh:oai:lup.lub.lu.se:c71618dd-556b-4d9b-95a4-b6b5d6ff9b62","is_oa":false,"landing_page_url":"https://lup.lub.lu.se/record/1477508","pdf_url":null,"source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN: 0097-5397","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6958986694","display_name":null,"funder_award_id":"EP/D063191/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1967066104","https://openalex.org/W1973113631","https://openalex.org/W1979740015","https://openalex.org/W1991858502","https://openalex.org/W2033961328","https://openalex.org/W2131676402","https://openalex.org/W2150875823","https://openalex.org/W2162118804","https://openalex.org/W2296148711","https://openalex.org/W4254807835"],"related_works":["https://openalex.org/W2259692984","https://openalex.org/W4300812862","https://openalex.org/W4296603869","https://openalex.org/W4283326397","https://openalex.org/W3115255814","https://openalex.org/W2163602512","https://openalex.org/W4308828639","https://openalex.org/W4316652277","https://openalex.org/W2796186646","https://openalex.org/W4294382020"],"abstract_inverted_index":{"We":[0,85,115],"show":[1],"that":[2,67],"a":[3,79,83,97,101,107,112,118,122,141,153,174],"maximum-weight":[4,80,98,108,119,154],"triangle":[5,76,99,120,139],"in":[6,22,82,100,121,128,140,147],"an":[7],"undirected":[8],"graph":[9,103,124,142],"with":[10,125,143],"n":[11],"vertices":[12,18],"and":[13,61,104],"real":[14],"weights":[15],"assigned":[16],"to":[17,90,111],"can":[19,86,116],"be":[20],"found":[21],"time":[23,45,64,130,148],"$\\mathcal{O}(n^{\\omega}+n^{2+o(1)})$,":[24],"where":[25],"$\\omega$":[26],"is":[27,49],"the":[28,31,37,43,55,69,92,133,169],"exponent":[29],"of":[30,46,68,161],"fastest":[32,70,134,170],"matrix":[33],"multiplication":[34],"algorithm.":[35],"By":[36],"currently":[38],"best":[39],"bound":[40],"on":[41,95,105],"$\\omega$,":[42],"running":[44],"our":[47,88],"algorithm":[48,52,72,89,135],"$\\mathcal{O}(n^{2.376})$.":[50],"Our":[51,150],"substantially":[53],"improves":[54],"previous":[56],"time-bounds":[57],"for":[58,73,136,152,173],"this":[59],"problem,":[60],"its":[62],"asymptotic":[63,129],"complexity":[65],"matches":[66],"known":[71,171],"finding":[74,96,106,137],"any":[75,138,159],"(not":[77],"necessarily":[78],"one)":[81],"graph.":[84,114],"extend":[87],"improve":[91],"upper":[93],"bounds":[94],"sparse":[102],"subgraph":[109,156],"isomorphic":[110],"fixed":[113,155,175],"find":[117],"vertex-weighted":[123],"m":[126,144],"edges":[127],"required":[131],"by":[132],"edges,":[145],"i.e.,":[146],"$\\mathcal{O}(m^{1.41})$.":[149],"algorithms":[151,172],"(in":[157],"particular":[158],"clique":[160],"constant":[162],"size)":[163],"are":[164],"asymptotically":[165],"as":[166,168],"fast":[167],"subgraph.":[176]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}