{"id":"https://openalex.org/W7109948233","doi":"https://doi.org/10.4230/lipics.icalp.2025.124","title":"Subgraph Counting in Subquadratic Time for Bounded Degeneracy Graphs","display_name":"Subgraph Counting in Subquadratic Time for Bounded Degeneracy Graphs","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W7109948233","doi":"https://doi.org/10.4230/lipics.icalp.2025.124"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:23501","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.124","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol334-icalp2025/LIPIcs.ICALP.2025.124/LIPIcs.ICALP.2025.124.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"type":"article","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol334-icalp2025/LIPIcs.ICALP.2025.124/LIPIcs.ICALP.2025.124.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Paul-Pena, Daniel","orcid":null},"institutions":[{"id":"https://openalex.org/I185103710","display_name":"University of California, Santa Cruz","ror":"https://ror.org/03s65by71","country_code":"US","type":"education","lineage":["https://openalex.org/I185103710"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Paul-Pena, Daniel","raw_affiliation_strings":["University of California, Santa Cruz, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Santa Cruz, CA, USA","institution_ids":["https://openalex.org/I185103710"]}]},{"author_position":"last","author":{"id":null,"display_name":"Seshadhri, C.","orcid":null},"institutions":[{"id":"https://openalex.org/I185103710","display_name":"University of California, Santa Cruz","ror":"https://ror.org/03s65by71","country_code":"US","type":"education","lineage":["https://openalex.org/I185103710"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Seshadhri, C.","raw_affiliation_strings":["University of California, Santa Cruz, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Santa Cruz, CA, USA","institution_ids":["https://openalex.org/I185103710"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I185103710"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.57736419,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.17309999465942383,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.17309999465942383,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.17159999907016754,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.14920000731945038,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/degeneracy","display_name":"Degeneracy (biology)","score":0.958299994468689},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.8403000235557556},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.6972000002861023},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.5612999796867371},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46299999952316284},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.4268999993801117},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41429999470710754}],"concepts":[{"id":"https://openalex.org/C2777727622","wikidata":"https://www.wikidata.org/wiki/Q5251772","display_name":"Degeneracy (biology)","level":2,"score":0.958299994468689},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.8403000235557556},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7095000147819519},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.6972000002861023},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6704000234603882},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.5612999796867371},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5228000283241272},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46299999952316284},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.4268999993801117},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41429999470710754},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.3643999993801117},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.3253999948501587},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.3165000081062317},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.2964000105857849},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2870999872684479},{"id":"https://openalex.org/C83204008","wikidata":"https://www.wikidata.org/wiki/Q4784907","display_name":"Arboricity","level":4,"score":0.2840000092983246},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.28290000557899475}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:23501","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.124","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol334-icalp2025/LIPIcs.ICALP.2025.124/LIPIcs.ICALP.2025.124.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:23501","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.124","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol334-icalp2025/LIPIcs.ICALP.2025.124/LIPIcs.ICALP.2025.124.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3667867886","display_name":"TRIPODS: Towards a Unified Theory of Structure, Incompleteness & Uncertainty in Heterogeneous Graphs","funder_award_id":"1740850","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4807382101","display_name":"TRIPODS: Institute for Foundations of Data Science","funder_award_id":"2023495","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5203381488","display_name":"TRIPODS+X:RES: Collaborative Research:Privacy-Preserving Genomic Data Analysis","funder_award_id":"1839317","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7488050316","display_name":"Collaborative Research: AF: Small: New Connections between Optimization and Property Testing","funder_award_id":"2402572","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W7109948233.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,130,200],"study":[1,119],"the":[2,13,52,171],"classic":[3],"problem":[4],"of":[5,15,17,28,41,63,83,120,159,211],"subgraph":[6,67,90,124,140,187,212],"counting,":[7],"where":[8],"we":[9,116,152],"wish":[10],"to":[11,193],"determine":[12],"number":[14],"occurrences":[16],"a":[18,38,60,80,118,149,183,208],"fixed":[19],"pattern":[20],"graph":[21,26,42],"H":[22,85,102,134],"in":[23,110,145,189,197],"an":[24,101],"input":[25],"G":[27],"n":[29],"vertices.":[30],"Our":[31,178],"focus":[32],"is":[33,79,92,182],"on":[34,51,126,174],"bounded":[35,71,127,175,190,215],"degeneracy":[36,72,128,176,191,216],"inputs,":[37],"rich":[39],"family":[40],"classes":[43],"that":[44,106,132,185,202],"also":[45],"characterizes":[46],"real-world":[47],"massive":[48],"networks.":[49],"Building":[50],"seminal":[53],"techniques":[54],"introduced":[55],"by":[56],"Chiba-Nishizeki":[57],"(SICOMP":[58],"1985),":[59],"recent":[61],"line":[62],"work":[64],"has":[65,135],"built":[66],"counting":[68,91,125,141,157,188,194,213],"algorithms":[69,122,155,167],"for":[70,86,123,156,170,214],"graphs.":[73,129,177,199,217],"Assuming":[74],"fine-grained":[75],"complexity":[76],"conjectures,":[77],"there":[78,99],"complete":[81],"characterization":[82],"patterns":[84],"which":[87],"linear":[88,111],"time":[89],"possible.":[93],"For":[94],"every":[95],"r":[96,104],"\u2265":[97],"6,":[98],"exists":[100],"with":[103],"vertices":[105],"cannot":[107],"be":[108,143],"counted":[109],"time.":[112,147],"In":[113],"this":[114],"paper,":[115],"initiate":[117],"subquadratic":[121,166],"prove":[131],"when":[133],"at":[136,161],"most":[137,162],"9":[138],"vertices,":[139],"can":[142],"done":[144],"O\u0303(n^{5/3})":[146],"As":[148],"secondary":[150],"result,":[151],"give":[153],"improved":[154],"cycles":[158],"length":[160],"10.":[163],"Previously,":[164],"no":[165],"were":[168],"known":[169],"above":[172],"problems":[173],"main":[179],"conceptual":[180],"contribution":[181],"framework":[184],"reduces":[186],"graphs":[192],"smaller":[195],"hypergraphs":[196],"arbitrary":[198],"believe":[201],"our":[203],"results":[204],"will":[205],"help":[206],"build":[207],"general":[209],"theory":[210]},"counts_by_year":[],"updated_date":"2026-08-08T01:25:22.217667","created_date":"2025-12-08T00:00:00"}