{"id":"https://openalex.org/W7166687661","doi":"https://doi.org/10.48550/arxiv.2606.29651","title":"NI-ORCA: A Parallel Algorithm for Counting the Orbits of Non-Induced Graphlets up to K4","display_name":"NI-ORCA: A Parallel Algorithm for Counting the Orbits of Non-Induced Graphlets up to K4","publication_year":2026,"publication_date":"2026-06-28","ids":{"openalex":"https://openalex.org/W7166687661","doi":"https://doi.org/10.48550/arxiv.2606.29651"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.29651","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.29651","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.29651","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5097398832","display_name":"Syed Ibtisam Tauhidi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tauhidi, Syed Ibtisam","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103566301","display_name":"Arindam Karmakar","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Karmakar, Arindam","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139651382","display_name":"Thai Son Mai","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mai, Thai Son","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5086758775","display_name":"Hans Vandierendonck","orcid":"https://orcid.org/0000-0001-5868-9259"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vandierendonck, Hans","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.8452000021934509,"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.8452000021934509,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.05590000003576279,"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"}},{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.023600000888109207,"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/speedup","display_name":"Speedup","score":0.616599977016449},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.569599986076355},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.511900007724762},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.4715000092983246},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4672999978065491},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.38280001282691956},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.35010001063346863},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.34540000557899475}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7781999707221985},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.616599977016449},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.569599986076355},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5608999729156494},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5235999822616577},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.511900007724762},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.4715000092983246},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4672999978065491},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.38280001282691956},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.35010001063346863},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.34540000557899475},{"id":"https://openalex.org/C196644772","wikidata":"https://www.wikidata.org/wiki/Q3884964","display_name":"Orbit (dynamics)","level":2,"score":0.3402000069618225},{"id":"https://openalex.org/C75684735","wikidata":"https://www.wikidata.org/wiki/Q858810","display_name":"Big data","level":2,"score":0.32089999318122864},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.303600013256073},{"id":"https://openalex.org/C175801342","wikidata":"https://www.wikidata.org/wiki/Q1988917","display_name":"Data analysis","level":2,"score":0.3009999990463257},{"id":"https://openalex.org/C79158427","wikidata":"https://www.wikidata.org/wiki/Q485396","display_name":"Analytics","level":2,"score":0.2919999957084656},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.2847999930381775},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.27480000257492065},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.2727000117301941},{"id":"https://openalex.org/C67186912","wikidata":"https://www.wikidata.org/wiki/Q367664","display_name":"Data modeling","level":2,"score":0.27239999175071716},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.25690001249313354},{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.2565000057220459},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.2563000023365021},{"id":"https://openalex.org/C151406439","wikidata":"https://www.wikidata.org/wiki/Q186588","display_name":"Time series","level":2,"score":0.2533000111579895}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.29651","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.29651","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.29651","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.29651","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Counting":[0],"the":[1,14,64,76,127],"orbits":[2,29,65],"of":[3,17,30,66,87,93,129,148],"graphlets":[4,68],"in":[5,19],"a":[6,9,58,85,146,154],"network":[7],"is":[8],"vital":[10],"tool":[11],"for":[12,50,79],"understanding":[13],"structural":[15],"roles":[16],"vertices":[18],"various":[20],"graph":[21],"analytics":[22],"tasks.":[23],"While":[24],"existing":[25],"algorithms":[26],"efficiently":[27,62],"compute":[28,63],"induced":[31],"graphlets,":[32],"many":[33],"real-world":[34,143],"applications":[35],"require":[36],"non-induced":[37,51,67,80],"orbit":[38,52,81,101],"counts.":[39],"However,":[40],"no":[41],"current":[42],"method":[43],"offers":[44],"exact,":[45],"scalable,":[46],"and":[47,100,105,112,116,121,134,145,171],"parallel":[48,59],"support":[49],"counting.":[53],"This":[54],"paper":[55],"presents":[56],"NI-ORCA,":[57],"algorithm":[60,91],"to":[61,70,187],"up":[69,186],"size":[71],"four":[72],"(4-clique).":[73],"NI-ORCA":[74,179],"extends":[75],"ORCA":[77],"framework":[78],"counting":[82],"by":[83],"reformulating":[84],"system":[86],"linear":[88],"equations.":[89],"The":[90],"consists":[92],"three":[94],"stages:":[95],"triangle":[96],"counting,":[97],"4-clique":[98],"enumeration,":[99],"solving.":[102],"We":[103,124],"design":[104],"implement":[106],"stage-specific":[107,158],"parallelisation":[108],"strategies":[109,136],"using":[110],"thread":[111],"vertex-local":[113],"memory":[114],"models":[115],"data":[117,159],"structures,":[118],"minimising":[119],"contention":[120],"balancing":[122],"workload.":[123],"further":[125],"analyse":[126],"impact":[128],"scheduling":[130,163],"policies,":[131],"chunk":[132,166],"sizes,":[133,167],"affinity":[135],"on":[137,141],"performance.":[138],"Experimental":[139],"analysis":[140],"eight":[142],"datasets":[144],"series":[147],"synthetic":[149],"Erddos-Renyi":[150],"graphs":[151],"demonstrates":[152],"that":[153,178],"mixed":[155],"mode":[156],"combining":[157],"structure,":[160],"with":[161,164],"dynamic":[162],"small":[165],"delivers":[168],"consistent":[169],"speedup":[170],"effective":[172],"load":[173],"balancing.":[174],"Our":[175],"results":[176],"show":[177],"significantly":[180],"outperforms":[181],"state-of-the-art":[182],"sequential":[183],"algorithms,":[184],"achieving":[185],"30x":[188],"speedups.":[189]},"counts_by_year":[],"updated_date":"2026-07-01T06:29:00.853634","created_date":"2026-07-01T00:00:00"}