{"id":"https://openalex.org/W4414405761","doi":"https://doi.org/10.1109/clusterworkshops65972.2025.11164209","title":"Parallel Counting of Non-Induced Graphlet Orbits","display_name":"Parallel Counting of Non-Induced Graphlet Orbits","publication_year":2025,"publication_date":"2025-09-02","ids":{"openalex":"https://openalex.org/W4414405761","doi":"https://doi.org/10.1109/clusterworkshops65972.2025.11164209"},"language":"en","primary_location":{"id":"doi:10.1109/clusterworkshops65972.2025.11164209","is_oa":false,"landing_page_url":"https://doi.org/10.1109/clusterworkshops65972.2025.11164209","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Conference on Cluster Computing Workshops (CLUSTER Workshops)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pure.qub.ac.uk/en/publications/66e668c5-2d4a-4051-bd0b-f5dedca06bf3","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5097398832","display_name":"Syed Ibtisam Tauhidi","orcid":null},"institutions":[{"id":"https://openalex.org/I126231945","display_name":"Queen's University Belfast","ror":"https://ror.org/00hswnk62","country_code":"GB","type":"education","lineage":["https://openalex.org/I126231945"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Syed Ibtisam Tauhidi","raw_affiliation_strings":["Queen’s University Belfast,Northern Ireland,UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Queen’s University Belfast,Northern Ireland,UK","institution_ids":["https://openalex.org/I126231945"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103566301","display_name":"Arindam Karmakar","orcid":null},"institutions":[{"id":"https://openalex.org/I126601174","display_name":"Tezpur University","ror":"https://ror.org/005x56091","country_code":"IN","type":"education","lineage":["https://openalex.org/I126601174"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Arindam Karmakar","raw_affiliation_strings":["Tezpur University,Assam,India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tezpur University,Assam,India","institution_ids":["https://openalex.org/I126601174"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113383438","display_name":"Thai Son","orcid":null},"institutions":[{"id":"https://openalex.org/I126231945","display_name":"Queen's University Belfast","ror":"https://ror.org/00hswnk62","country_code":"GB","type":"education","lineage":["https://openalex.org/I126231945"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Thai Son Mai","raw_affiliation_strings":["Queen’s University Belfast,Northern Ireland,UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Queen’s University Belfast,Northern Ireland,UK","institution_ids":["https://openalex.org/I126231945"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086758775","display_name":"Hans Vandierendonck","orcid":"https://orcid.org/0000-0001-5868-9259"},"institutions":[{"id":"https://openalex.org/I126231945","display_name":"Queen's University Belfast","ror":"https://ror.org/00hswnk62","country_code":"GB","type":"education","lineage":["https://openalex.org/I126231945"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Hans Vandierendonck","raw_affiliation_strings":["Queen’s University Belfast,Northern Ireland,UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Queen’s University Belfast,Northern Ireland,UK","institution_ids":["https://openalex.org/I126231945"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"2"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9858999848365784,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9858999848365784,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12029","display_name":"DNA and Biological Computing","score":0.945900022983551,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9433000087738037,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/orbit","display_name":"Orbit (dynamics)","score":0.6309999823570251},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5590999722480774},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5041000247001648},{"id":"https://openalex.org/keywords/subtractive-color","display_name":"Subtractive color","score":0.32510000467300415},{"id":"https://openalex.org/keywords/noisy-data","display_name":"Noisy data","score":0.32409998774528503},{"id":"https://openalex.org/keywords/orbit-determination","display_name":"Orbit determination","score":0.30399999022483826}],"concepts":[{"id":"https://openalex.org/C196644772","wikidata":"https://www.wikidata.org/wiki/Q3884964","display_name":"Orbit (dynamics)","level":2,"score":0.6309999823570251},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5590999722480774},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5041000247001648},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49050000309944153},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4514999985694885},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43700000643730164},{"id":"https://openalex.org/C150799807","wikidata":"https://www.wikidata.org/wiki/Q374081","display_name":"Subtractive color","level":2,"score":0.32510000467300415},{"id":"https://openalex.org/C2781170535","wikidata":"https://www.wikidata.org/wiki/Q30587856","display_name":"Noisy data","level":2,"score":0.32409998774528503},{"id":"https://openalex.org/C107768556","wikidata":"https://www.wikidata.org/wiki/Q302660","display_name":"Orbit determination","level":3,"score":0.30399999022483826},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.2903999984264374},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.27889999747276306},{"id":"https://openalex.org/C2984157986","wikidata":"https://www.wikidata.org/wiki/Q3884964","display_name":"Periodic orbits","level":2,"score":0.27079999446868896},{"id":"https://openalex.org/C2992692520","wikidata":"https://www.wikidata.org/wiki/Q3931124","display_name":"Reality check","level":3,"score":0.26460000872612},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.2524999976158142}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/clusterworkshops65972.2025.11164209","is_oa":false,"landing_page_url":"https://doi.org/10.1109/clusterworkshops65972.2025.11164209","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Conference on Cluster Computing Workshops (CLUSTER Workshops)","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.qub.ac.uk/portal:openaire/66e668c5-2d4a-4051-bd0b-f5dedca06bf3","is_oa":true,"landing_page_url":"https://pure.qub.ac.uk/en/publications/66e668c5-2d4a-4051-bd0b-f5dedca06bf3","pdf_url":null,"source":{"id":"https://openalex.org/S4306402319","display_name":"Research Portal (Queen's University Belfast)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I126231945","host_organization_name":"Queen's University Belfast","host_organization_lineage":["https://openalex.org/I126231945"],"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":"Tauhidi, S I, Karmakar, A, Mai, T S & Vandierendonck, H 2025, Parallel counting of non-induced graphlet orbits. in 2025 IEEE International Conference on Cluster Computing Workshops (CLUSTER Workshops): Proceedings. IEEE. https://doi.org/10.1109/CLUSTERWorkshops65972.2025.11164209","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:pure.qub.ac.uk/portal:openaire/66e668c5-2d4a-4051-bd0b-f5dedca06bf3","is_oa":true,"landing_page_url":"https://pure.qub.ac.uk/en/publications/66e668c5-2d4a-4051-bd0b-f5dedca06bf3","pdf_url":null,"source":{"id":"https://openalex.org/S4306402319","display_name":"Research Portal (Queen's University Belfast)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I126231945","host_organization_name":"Queen's University Belfast","host_organization_lineage":["https://openalex.org/I126231945"],"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":"Tauhidi, S I, Karmakar, A, Mai, T S & Vandierendonck, H 2025, Parallel counting of non-induced graphlet orbits. in 2025 IEEE International Conference on Cluster Computing Workshops (CLUSTER Workshops): Proceedings. IEEE. https://doi.org/10.1109/CLUSTERWorkshops65972.2025.11164209","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320311649","display_name":"Ministry of Education","ror":"https://ror.org/036nq5137"},{"id":"https://openalex.org/F4320327687","display_name":"Tezpur University","ror":"https://ror.org/005x56091"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2157312249","https://openalex.org/W2256826326","https://openalex.org/W2996939161","https://openalex.org/W4407736999"],"related_works":[],"abstract_inverted_index":{"Orbit":[0],"counting":[1,20,45],"of":[2,46],"graphlets":[3],"is":[4,21],"crucial":[5],"in":[6,13,32],"network":[7],"science":[8],"to":[9,51,81],"understand":[10],"vertex":[11],"roles":[12],"local":[14],"structures.":[15],"While":[16],"induced":[17],"graphlet":[18,48],"orbit":[19,25],"well":[22],"studied,":[23],"non-induced":[24,47],"analysis":[26],"remains":[27],"underserved":[28],"despite":[29],"its":[30],"importance":[31],"noisy":[33],"or":[34],"incomplete":[35],"networks.":[36],"We":[37],"introduce":[38],"NI-ORCA,":[39],"a":[40],"parallel":[41],"algorithm":[42],"for":[43],"exact":[44],"orbits":[49],"up":[50,80],"K4.":[52],"NI-ORCA":[53],"extends":[54],"the":[55],"ORCA":[56],"framework":[57],"by":[58],"replacing":[59],"subtractive":[60],"corrections":[61],"with":[62],"direct":[63],"formulations.":[64],"It":[65],"employs":[66],"stage-specific":[67],"parallelisation,":[68],"memory-aware":[69],"data":[70],"structures,":[71],"and":[72,84],"OpenMP":[73],"scheduling.":[74],"Evaluations":[75],"on":[76],"real-world":[77],"datasets":[78],"demonstrate":[79],"30\u00d7":[82],"speedup":[83],"robust":[85],"scalability.":[86]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}