{"id":"https://openalex.org/W7129168548","doi":"https://doi.org/10.48550/arxiv.2602.12668","title":"Independence-Number Parameterized Space Complexity for Directed Connectivity Certificate","display_name":"Independence-Number Parameterized Space Complexity for Directed Connectivity Certificate","publication_year":2026,"publication_date":"2026-02-13","ids":{"openalex":"https://openalex.org/W7129168548","doi":"https://doi.org/10.48550/arxiv.2602.12668"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.12668","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":null,"raw_type":"Article"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087513049","display_name":"Ho-Lin Chen","orcid":"https://orcid.org/0000-0002-6171-9962"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen, Ho-Lin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126136466","display_name":"Tsun Ming Cheung","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cheung, Tsun Ming","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026962129","display_name":"Pengting Lin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lin, Peng-Ting","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5064418445","display_name":"Meng-Tsung Tsai","orcid":"https://orcid.org/0000-0002-2243-8666"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tsai, Meng-Tsung","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":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.21171784,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9089999794960022,"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.9089999794960022,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.013500000350177288,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.0071000000461936,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.6227999925613403},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6065000295639038},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5792999863624573},{"id":"https://openalex.org/keywords/certificate","display_name":"Certificate","score":0.5767999887466431},{"id":"https://openalex.org/keywords/feedback-arc-set","display_name":"Feedback arc set","score":0.4544000029563904},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4417000114917755},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.429500013589859},{"id":"https://openalex.org/keywords/strongly-connected-component","display_name":"Strongly connected component","score":0.4034000039100647},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.3840999901294708}],"concepts":[{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.6227999925613403},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6065000295639038},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5792999863624573},{"id":"https://openalex.org/C96865113","wikidata":"https://www.wikidata.org/wiki/Q2946816","display_name":"Certificate","level":2,"score":0.5767999887466431},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5250999927520752},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4564000070095062},{"id":"https://openalex.org/C157951044","wikidata":"https://www.wikidata.org/wiki/Q1400910","display_name":"Feedback arc set","level":5,"score":0.4544000029563904},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45100000500679016},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4417000114917755},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.429500013589859},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.4034000039100647},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39250001311302185},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.3840999901294708},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.37209999561309814},{"id":"https://openalex.org/C136975688","wikidata":"https://www.wikidata.org/wiki/Q1320634","display_name":"Tournament","level":2,"score":0.36910000443458557},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3682999908924103},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.3666999936103821},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.351500004529953},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3490000069141388},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3443000018596649},{"id":"https://openalex.org/C198414033","wikidata":"https://www.wikidata.org/wiki/Q5155607","display_name":"Comparability graph","level":5,"score":0.33480000495910645},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.3147999942302704},{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.3061000108718872},{"id":"https://openalex.org/C17169500","wikidata":"https://www.wikidata.org/wiki/Q3033506","display_name":"Null graph","level":5,"score":0.30489999055862427},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.2768999934196472},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27549999952316284},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.25189998745918274}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.12668","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.12668","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.12668","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"pmh:doi:10.48550/arxiv.2602.12668","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,18,52,70,78,106,155,208,212,232,245],"space":[3,206],"complexity":[4,157],"of":[5,10,47,54,77,81,144,158,173,201,267],"computing":[6],"a":[7,11,25,32,38,110,113,131,151,171,196,226,255,264],"sparse":[8],"subgraph":[9,39],"directed":[12,26,82,114,176,268],"graph":[13,27,91,108,177,184,269],"that":[14,43,94,97,154,194,217],"certifies":[15],"connectivity":[16,35,83,160,178,199,229],"in":[17,63,73,100,133,207,231],"streaming":[19,156,223],"and":[20,29,124,137,162],"distributed":[21],"models.":[22],"Formally,":[23],"for":[24,44,175,181,225],"$G=(V,A)$":[28],"$k\\in":[30],"\\mathbb{N}$,":[31],"$k$-node":[33,197],"strong":[34,159,198,228],"certificate":[36,200,230],"is":[37,65,109,165,260],"$H=(V,A')\\subseteq":[40],"G$":[41],"such":[42],"every":[45],"pair":[46],"distinct":[48],"nodes":[49],"$s,t\\in":[50],"V$,":[51],"number":[53,72,187],"pairwise":[55],"internally":[56],"node-disjoint":[57],"paths":[58],"from":[59],"$s$":[60],"to":[61,130,249,262],"$t$":[62],"$H$":[64],"at":[66,150],"least":[67],"$k$":[68],"or":[69,128],"corresponding":[71],"$G$.":[74],"In":[75],"light":[76],"inherent":[79],"hardness":[80,174],"problems,":[84],"several":[85,95],"prior":[86],"work":[87],"focused":[88],"on":[89],"restricted":[90],"classes,":[92],"showing":[93],"problems":[96,164],"are":[98],"hard":[99,252],"general":[101],"become":[102],"efficiently":[103],"solvable":[104],"when":[105,219],"input":[107],"tournament":[111,132,247],"(i.e.,":[112],"complete":[115],"graph)":[116],"(Chakrabarti":[117],"et":[118],"al.":[119],"[SODA":[120],"2020];":[121],"Baweja,":[122],"Jia,":[123],"Woddruff":[125],"[ITCS":[126],"2022]),":[127],"close":[129],"edit":[134],"distance":[135],"(Ghosh":[136],"Kuchlous":[138],"[ESA":[139],"2024]).":[140],"Extending":[141],"this":[142],"line":[143],"work,":[145],"our":[146],"main":[147],"result":[148],"shows,":[149],"qualitative":[152],"level,":[153],"certificates":[161],"related":[163],"parameterized":[166],"by":[167],"independence":[168,186,257],"number,":[169,258],"demonstrating":[170],"continuum":[172],"problems.":[179,270],"Quantitatively,":[180],"an":[182],"$n$-node":[183],"with":[185,254],"$\u03b1$,":[188],"we":[189,215,243],"give":[190],"$p$-pass":[191,222],"randomized":[192],"algorithms":[193],"compute":[195],"size":[202],"$O(\u03b1n)$":[203],"using":[204],"$\\tilde{O}(k^{1-1/p}\u03b1n^{1+1/p})$":[205],"insertion-only":[209,233],"model.":[210],"For":[211],"lower":[213,241],"bound,":[214],"show":[216],"even":[218],"$k=1$,":[220],"any":[221],"algorithm":[224],"1-node":[227],"model":[234],"requires":[235],"$\u03a9(\u03b1n/p)$":[236],"space.":[237],"To":[238],"derive":[239],"these":[240],"bounds,":[242],"introduce":[244],"gadget-embedding":[246],"framework":[248],"construct":[250],"direct-sum-type":[251],"instances":[253],"prescribed":[256],"which":[259],"applicable":[261],"lower-bounding":[263],"wide":[265],"range":[266]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-02-17T00:00:00"}