{"id":"https://openalex.org/W4415435759","doi":"https://doi.org/10.1145/3771997","title":"Fast Assessment of Eulerian Trails in Graphs with Applications","display_name":"Fast Assessment of Eulerian Trails in Graphs with Applications","publication_year":2025,"publication_date":"2025-10-22","ids":{"openalex":"https://openalex.org/W4415435759","doi":"https://doi.org/10.1145/3771997"},"language":"en","primary_location":{"id":"doi:10.1145/3771997","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3771997","pdf_url":null,"source":{"id":"https://openalex.org/S41523882","display_name":"ACM Transactions on Knowledge Discovery from Data","issn_l":"1556-4681","issn":["1556-4681","1556-472X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Knowledge Discovery from Data","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.vu.nl/en/publications/1594d600-86b9-41ea-ae54-fd692f156da4","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086573637","display_name":"Alessio Conte","orcid":"https://orcid.org/0000-0003-0770-2235"},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Alessio Conte","raw_affiliation_strings":["University of Pisa, Pisa, Italy"],"affiliations":[{"raw_affiliation_string":"University of Pisa, Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006984021","display_name":"Roberto Grossi","orcid":"https://orcid.org/0000-0002-7985-4222"},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Roberto Grossi","raw_affiliation_strings":["University of Pisa, Pisa, Italy"],"affiliations":[{"raw_affiliation_string":"University of Pisa, Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065416953","display_name":"Grigorios Loukides","orcid":"https://orcid.org/0000-0003-0888-5061"},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Grigorios Loukides","raw_affiliation_strings":["King\u2019s College London, London, UK"],"affiliations":[{"raw_affiliation_string":"King\u2019s College London, London, UK","institution_ids":["https://openalex.org/I183935753"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081785647","display_name":"Nadia Pisanti","orcid":"https://orcid.org/0000-0003-3915-7665"},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Nadia Pisanti","raw_affiliation_strings":["University of Pisa, Pisa, Italy"],"affiliations":[{"raw_affiliation_string":"University of Pisa, Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051275317","display_name":"Solon P. Pissis","orcid":"https://orcid.org/0000-0002-1445-1932"},"institutions":[{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]},{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Solon P. Pissis","raw_affiliation_strings":["CWI, Amsterdam, The Netherlands and Vrije Universiteit, Amsterdam, The Netherlands"],"affiliations":[{"raw_affiliation_string":"CWI, Amsterdam, The Netherlands and Vrije Universiteit, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I1341640284","https://openalex.org/I865915315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103115466","display_name":"Giulia Punzi","orcid":"https://orcid.org/0000-0001-8738-1595"},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Giulia Punzi","raw_affiliation_strings":["University of Pisa, Pisa, Italy"],"affiliations":[{"raw_affiliation_string":"University of Pisa, Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5086573637"],"corresponding_institution_ids":["https://openalex.org/I108290504"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.3164312,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"20","issue":"1","first_page":"1","last_page":"33"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9988999962806702,"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"}},{"id":"https://openalex.org/T12536","display_name":"Topological and Geometric Data Analysis","score":0.998199999332428,"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/eulerian-path","display_name":"Eulerian path","score":0.8866999745368958},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46970000863075256},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4372999966144562},{"id":"https://openalex.org/keywords/multiplication","display_name":"Multiplication (music)","score":0.39250001311302185},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.364300012588501},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.3431999981403351},{"id":"https://openalex.org/keywords/ranging","display_name":"Ranging","score":0.3377000093460083}],"concepts":[{"id":"https://openalex.org/C43058520","wikidata":"https://www.wikidata.org/wiki/Q624580","display_name":"Eulerian path","level":3,"score":0.8866999745368958},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48489999771118164},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46970000863075256},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4666999876499176},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45239999890327454},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4372999966144562},{"id":"https://openalex.org/C2780595030","wikidata":"https://www.wikidata.org/wiki/Q3860309","display_name":"Multiplication (music)","level":2,"score":0.39250001311302185},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3736000061035156},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.364300012588501},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3431999981403351},{"id":"https://openalex.org/C115051666","wikidata":"https://www.wikidata.org/wiki/Q6522493","display_name":"Ranging","level":2,"score":0.3377000093460083},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3370000123977661},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.3353999853134155},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.33410000801086426},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32330000400543213},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.28610000014305115},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2761000096797943},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2705000042915344},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.25}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3771997","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3771997","pdf_url":null,"source":{"id":"https://openalex.org/S41523882","display_name":"ACM Transactions on Knowledge Discovery from Data","issn_l":"1556-4681","issn":["1556-4681","1556-472X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Knowledge Discovery from Data","raw_type":"journal-article"},{"id":"pmh:oai:research.vu.nl:openaire/1594d600-86b9-41ea-ae54-fd692f156da4","is_oa":true,"landing_page_url":"https://research.vu.nl/en/publications/1594d600-86b9-41ea-ae54-fd692f156da4","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Conte, A, Grossi, R, Loukides, G, Pisanti, N, Pissis, S P & Punzi, G 2026, 'Fast Assessment of Eulerian Trails in Graphs with Applications', ACM Transactions on Knowledge Discovery from Data, vol. 20, no. 1, 14, pp. 1-33. https://doi.org/10.1145/3771997","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:HAL:hal-05435063v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-05435063","pdf_url":null,"source":{"id":"https://openalex.org/S4406922466","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"ACM Transactions on Knowledge Discovery from Data (TKDD), 2025, 20 (1, Article 14), pp.1-33. ⟨10.1145/3771997⟩","raw_type":"Journal articles"},{"id":"pmh:oai:research.vu.nl:publications/1594d600-86b9-41ea-ae54-fd692f156da4","is_oa":true,"landing_page_url":"https://hdl.handle.net/1871.1/1594d600-86b9-41ea-ae54-fd692f156da4","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Conte, A, Grossi, R, Loukides, G, Pisanti, N, Pissis, S P & Punzi, G 2026, 'Fast Assessment of Eulerian Trails in Graphs with Applications', ACM Transactions on Knowledge Discovery from Data, vol. 20, no. 1, 14, pp. 1-33. https://doi.org/10.1145/3771997","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:research.vu.nl:openaire/1594d600-86b9-41ea-ae54-fd692f156da4","is_oa":true,"landing_page_url":"https://research.vu.nl/en/publications/1594d600-86b9-41ea-ae54-fd692f156da4","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Conte, A, Grossi, R, Loukides, G, Pisanti, N, Pissis, S P & Punzi, G 2026, 'Fast Assessment of Eulerian Trails in Graphs with Applications', ACM Transactions on Knowledge Discovery from Data, vol. 20, no. 1, 14, pp. 1-33. https://doi.org/10.1145/3771997","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1970939265","https://openalex.org/W1973343935","https://openalex.org/W1974848406","https://openalex.org/W2022871748","https://openalex.org/W2038205735","https://openalex.org/W2042325991","https://openalex.org/W2065128082","https://openalex.org/W2079048435","https://openalex.org/W2118382442","https://openalex.org/W2120248756","https://openalex.org/W2136651963","https://openalex.org/W2151674273","https://openalex.org/W2153624566","https://openalex.org/W2582012466","https://openalex.org/W2763834249","https://openalex.org/W2799870013","https://openalex.org/W2890101900","https://openalex.org/W3004718539","https://openalex.org/W3100724262","https://openalex.org/W3110665143","https://openalex.org/W3152595148","https://openalex.org/W3160724071","https://openalex.org/W3178506142","https://openalex.org/W4226226456","https://openalex.org/W4239110337","https://openalex.org/W4247794781","https://openalex.org/W4250331344","https://openalex.org/W4301113013","https://openalex.org/W4392121217","https://openalex.org/W4406142226"],"related_works":[],"abstract_inverted_index":{"Enumerating":[0],"or":[1],"counting":[2],"combinatorial":[3,187,265],"objects":[4],"in":[5,24,75,101,131,158,254,319,333],"graphs":[6],"is":[7,28,63,142,156],"a":[8,33,186,205,210,230,243,272,334],"fundamental":[9],"data":[10,79,84,246,335],"mining":[11],"task.":[12],"We":[13,182,221,227,240],"consider":[14],"the":[15,19,53,96,125,135,145,160,167,200,250,261,303,340,344],"problem":[16,71,93,168],"of":[17,21,56,59,106,140,150,173,212,252,275,299],"assessing":[18,108,190,235],"number":[20,54,136,146,251],"Eulerian":[22,57,238],"trails":[23,58],"directed":[25,34],"graphs,":[26,134],"which":[27,195,338],"formalized":[29],"as":[30,209,225],"follows:":[31],"Given":[32],"graph":[35],"\\(G=(V,E)\\)":[36],",":[37,50,194],"with":[38,263,271,284,315],"\\(|V|=n\\)":[39],"nodes":[40],"and":[41,44,86,152,177,203,216,312],"\\(|E|=m\\)":[42],"edges,":[43],"an":[45,269],"integer":[46],"\\(":[47,60,66,137,147,153,174,178,213,217,316],"z":[48,67,154,179,218],"\\)":[49,62,68,139,149,155,176,180,215,219,318],"assess":[51],"whether":[52,109,191],"\\(\\#ET(G)\\)":[55,104],"G":[61],"at":[64],"least":[65],".":[69,112,129,220],"This":[70],"underlies":[72],"many":[73],"applications":[74],"domains":[76,289],"ranging":[77],"from":[78,287],"privacy":[80,336],"to":[81,144,184,199,248,268,296],"computational":[82],"biology,":[83],"compression,":[85],"transportation":[87],"networks.":[88],"Practitioners":[89],"currently":[90],"address":[91,222],"this":[92,114,223,255],"by":[94],"applying":[95],"famous":[97],"BEST":[98,201,304,341],"theorem,":[99,305],"which,":[100],"fact,":[102],"counts":[103],"instead":[105],"just":[107],"\\(\\#ET(G)\\geq":[110,192],"z\\)":[111,193],"Unfortunately,":[113],"solution":[115],"takes":[116],"\\(\\mathcal{O}(n^{\\omega})\\)":[117],"arithmetic":[118],"operations,":[119],"where":[120],"\\(\\omega":[121],"<":[122],"2.373\\)":[123],"denotes":[124],"matrix":[126],"multiplication":[127],"exponent":[128],"Since":[130],"most":[132,320],"real-world":[133],"m":[138,175,214,317],"edges":[141,286],"comparable":[143],"n":[148],"nodes,":[151],"moderate":[157],"practice,":[159],"algorithmic":[161,232],"challenge":[162,224],"is:":[163],"Can":[164],"we":[165,259],"solve":[166],"faster":[169,301],"for":[170,189,234,343],"certain":[171],"values":[172],"?":[181],"want":[183],"design":[185],"algorithm":[188,270],"does":[196],"not":[197],"resort":[198],"theorem":[202,342],"has":[204],"predictably":[206],"bounded":[207],"cost":[208],"function":[211],"follows.":[226],"first":[228],"introduce":[229,242],"general":[231,256],"scheme":[233],"(and":[236],"enumerating)":[237],"trails.":[239],"then":[241],"novel":[244],"tree":[245],"structure":[247],"reduce":[249],"iterations":[253,311],"scheme.":[257],"Finally,":[258],"complement":[260],"above":[262],"further":[264,324],"insight":[266],"leading":[267],"worst-case":[273],"bound":[274],"\\(\\mathcal{O}(m\\cdot\\min\\{z,\\#ET(G)\\})\\)":[276],"time.":[277],"Our":[278,322],"experiments":[279,323],"using":[280],"six":[281],"benchmark":[282],"datasets":[283],"multi-million":[285],"different":[288],"show":[290,325],"that":[291,326],"our":[292,327],"implementations":[293,328],"are":[294],"up":[295],"two":[297],"orders":[298],"magnitude":[300],"than":[302,309],"perform":[306],"much":[307],"fewer":[308],"\\(mz\\)":[310],"scale":[313],"near-linearly":[314],"cases.":[321],"bring":[329],"substantial":[330],"efficiency":[331],"benefits":[332],"application":[337],"employs":[339],"assessment.":[345]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-24T00:00:00"}