{"id":"https://openalex.org/W2004694806","doi":"https://doi.org/10.1137/s0097539793247634","title":"A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph","display_name":"A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph","publication_year":1995,"publication_date":"1995-06-01","ids":{"openalex":"https://openalex.org/W2004694806","doi":"https://doi.org/10.1137/s0097539793247634","mag":"2004694806"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539793247634","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793247634","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/A5072612870","display_name":"Richard A. Duke","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Richard A. Duke","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111723650","display_name":"Hanno Lefmann","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hanno Lefmann","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5109115706","display_name":"V. R\u00f6dl","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vojtch R\u00f6dl","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5072612870"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1481,"has_fulltext":false,"cited_by_count":112,"citation_normalized_percentile":{"value":0.86370241,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"24","issue":"3","first_page":"598","last_page":"620"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12404","display_name":"Mathematical Approximation and Integration","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7473466396331787},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5693747401237488},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5080258846282959},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.461295485496521},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4598776400089264},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45737481117248535},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.42139044404029846},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32869482040405273}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7473466396331787},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5693747401237488},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5080258846282959},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.461295485496521},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4598776400089264},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45737481117248535},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.42139044404029846},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32869482040405273},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539793247634","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793247634","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1979740015","https://openalex.org/W1980501966","https://openalex.org/W1984080039","https://openalex.org/W2052053964","https://openalex.org/W2083580384","https://openalex.org/W2120240525","https://openalex.org/W2147310610"],"related_works":["https://openalex.org/W2735923117","https://openalex.org/W2115913661","https://openalex.org/W3168772390","https://openalex.org/W1576970471","https://openalex.org/W2118860231","https://openalex.org/W2028468530","https://openalex.org/W3102280101","https://openalex.org/W2419219947","https://openalex.org/W2963656294","https://openalex.org/W9190679"],"abstract_inverted_index":{"In":[0],"this":[1,31,84],"paper":[2],"we":[3],"give":[4],"an":[5,33,68],"algorithm":[6,50,85],"which,":[7],"given":[8],"a":[9,16,87],"labeled":[10,20],"graph":[11,28],"on":[12,22],"n":[13,69,71],"vertices":[14],"and":[15],"list":[17,32],"of":[18,30,38,41,89,93],"all":[19],"graphs":[21],"k":[23],"vertices,":[24],"provides":[25],"for":[26],"each":[27],"H":[29,42],"approximation":[34],"to":[35,66],"the":[36,63,77,90],"number":[37],"induced":[39],"copies":[40],"in":[43,82],"G":[44],"with":[45,73],"total":[46],"error":[47],"small.":[48],"This":[49],"has":[51],"running":[52],"time":[53,64],"$O(n^{1/":[54],"\\log":[55,56],"n}":[57],"\\cdot":[58],"M(n))$,":[59],"where":[60],"$M(n)$":[61],"is":[62,86],"needed":[65],"square":[67],"by":[70],"matrix":[72],"0,":[74],"1-entries":[75],"over":[76],"integers.":[78],"The":[79],"main":[80],"tool":[81],"designing":[83],"variant":[88],"regularity":[91],"lemma":[92],"Szemer\u00e9di.":[94]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":6}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}