{"id":"https://openalex.org/W7110981054","doi":"https://doi.org/10.4230/lipics.fsttcs.2025.23","title":"Parallel Complexity of Depth-First-Search and Maximal Path in Restricted Graph Classes","display_name":"Parallel Complexity of Depth-First-Search and Maximal Path in Restricted Graph Classes","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W7110981054","doi":"https://doi.org/10.4230/lipics.fsttcs.2025.23"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25104","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2025.23","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol360-fsttcs2025/LIPIcs.FSTTCS.2025.23/LIPIcs.FSTTCS.2025.23.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":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol360-fsttcs2025/LIPIcs.FSTTCS.2025.23/LIPIcs.FSTTCS.2025.23.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Chauhan, Archit","orcid":"https://orcid.org/0009-0008-3681-9743"},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Chauhan, Archit","raw_affiliation_strings":["Department of Computer Science and Engineering, IIT Bombay, India"],"raw_orcid":"https://orcid.org/0009-0008-3681-9743","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, IIT Bombay, India","institution_ids":["https://openalex.org/I162827531"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Datta, Samir","orcid":"https://orcid.org/0000-0003-2196-2308"},"institutions":[{"id":"https://openalex.org/I19149307","display_name":"Chennai Mathematical Institute","ror":"https://ror.org/04zp24820","country_code":"IN","type":"education","lineage":["https://openalex.org/I19149307"]},{"id":"https://openalex.org/I4210101699","display_name":"Indo-French Centre for the Promotion of Advanced Research","ror":"https://ror.org/017aem598","country_code":"IN","type":"facility","lineage":["https://openalex.org/I4210101699"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Datta, Samir","raw_affiliation_strings":["Chennai Mathematical Institute, India","UMI ReLaX, Indo-French joint research unit, Chennai, India"],"raw_orcid":"https://orcid.org/0000-0003-2196-2308","affiliations":[{"raw_affiliation_string":"Chennai Mathematical Institute, India","institution_ids":["https://openalex.org/I19149307"]},{"raw_affiliation_string":"UMI ReLaX, Indo-French joint research unit, Chennai, India","institution_ids":["https://openalex.org/I4210101699"]}]},{"author_position":"last","author":{"id":null,"display_name":"Praveen, M.","orcid":"https://orcid.org/0000-0002-5734-7115"},"institutions":[{"id":"https://openalex.org/I19149307","display_name":"Chennai Mathematical Institute","ror":"https://ror.org/04zp24820","country_code":"IN","type":"education","lineage":["https://openalex.org/I19149307"]},{"id":"https://openalex.org/I4210101699","display_name":"Indo-French Centre for the Promotion of Advanced Research","ror":"https://ror.org/017aem598","country_code":"IN","type":"facility","lineage":["https://openalex.org/I4210101699"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Praveen, M.","raw_affiliation_strings":["Chennai Mathematical Institute, India","UMI ReLaX, Indo-French joint research unit, Chennai, India"],"raw_orcid":"https://orcid.org/0000-0002-5734-7115","affiliations":[{"raw_affiliation_string":"Chennai Mathematical Institute, India","institution_ids":["https://openalex.org/I19149307"]},{"raw_affiliation_string":"UMI ReLaX, Indo-French joint research unit, Chennai, India","institution_ids":["https://openalex.org/I4210101699"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I162827531"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.65493945,"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.6757000088691711,"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.6757000088691711,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.2971000075340271,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.00430000014603138,"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/bounded-function","display_name":"Bounded function","score":0.5404000282287598},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5285999774932861},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5048999786376953},{"id":"https://openalex.org/keywords/block-graph","display_name":"Block graph","score":0.4221999943256378},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4056999981403351},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.39410001039505005},{"id":"https://openalex.org/keywords/outerplanar-graph","display_name":"Outerplanar graph","score":0.38909998536109924},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3779999911785126},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.366100013256073}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6898000240325928},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6151999831199646},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5404000282287598},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5393999814987183},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5285999774932861},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5048999786376953},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.4221999943256378},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4056999981403351},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.39410001039505005},{"id":"https://openalex.org/C125792925","wikidata":"https://www.wikidata.org/wiki/Q3115604","display_name":"Outerplanar graph","level":5,"score":0.38909998536109924},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3779999911785126},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.366100013256073},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.34220001101493835},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.33160001039505005},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.3221000134944916},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.3163999915122986},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3086000084877014},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.3046000003814697},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.30309998989105225},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.3010999858379364},{"id":"https://openalex.org/C95023266","wikidata":"https://www.wikidata.org/wiki/Q55738334","display_name":"Series and parallel circuits","level":3,"score":0.2948000133037567},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.275299996137619},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.2750000059604645},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.2685000002384186},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2635999917984009},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.2597000002861023},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2535000145435333}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25104","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2025.23","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol360-fsttcs2025/LIPIcs.FSTTCS.2025.23/LIPIcs.FSTTCS.2025.23.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":"publishedVersion"},{"id":"doi:10.4230/lipics.fsttcs.2025.23","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.fsttcs.2025.23","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25104","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2025.23","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol360-fsttcs2025/LIPIcs.FSTTCS.2025.23/LIPIcs.FSTTCS.2025.23.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":"publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322753","display_name":"Infosys Foundation","ror":"https://ror.org/03bs18y54"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7110981054.pdf","grobid_xml":"https://content.openalex.org/works/W7110981054.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Constructing":[0,132],"a":[1,8,42,49,65,107,129,133,137,158,166],"Depth":[2],"First":[3],"Search":[4],"(DFS)":[5],"tree":[6,44],"is":[7,15,106,136,172],"fundamental":[9],"graph":[10,88,109],"problem,":[11],"whose":[12],"parallel":[13,21,29,36,51,148,163],"complexity":[14,127],"still":[16],"not":[17],"settled.":[18],"Reif":[19],"showed":[20],"intractability":[22],"of":[23,67,96,118,120,160],"lex-first":[24],"DFS.":[25],"In":[26],"contrast,":[27],"randomized":[28],"algorithms":[30,72,93],"(and":[31],"more":[32,86],"recently,":[33],"deterministic":[34,50,70,147],"quasipolynomial":[35],"algorithms)":[37],"are":[38,150],"known":[39,151],"for":[40,53,73,94,100,144,152],"constructing":[41],"DFS":[43,54,74],"in":[45,55,75,170],"general":[46,56,87,153],"(di)graphs.":[47],"However":[48],"algorithm":[52],"graphs":[57,77,103,157],"remains":[58],"an":[59],"elusive":[60],"goal.":[61],"Working":[62],"towards":[63],"this,":[64],"series":[66],"works":[68],"gave":[69],"NC":[71,92],"planar":[76,156],"and":[78,99],"digraphs.":[79],"We":[80,174],"further":[81,124],"extend":[82],"these":[83],"results":[84],"to":[85,128,142,178],"classes,":[89],"by":[90],"providing":[91],"(di)graphs":[95,119],"bounded":[97,121],"genus,":[98],"undirected":[101],"H-minor-free":[102],"where":[104],"H":[105],"fixed":[108],"with":[110],"at":[111],"most":[112],"one":[113],"crossing.":[114],"For":[115,155],"the":[116,126],"case":[117],"treewidth,":[122],"we":[123],"improve":[125,175],"Logspace":[130],"bound.":[131],"maximal":[134],"path":[135],"simpler":[138],"problem":[139],"(that":[140],"reduces":[141],"DFS)":[143],"which":[145],"no":[146],"bounds":[149],"graphs.":[154],"bound":[159,177],"O(log":[161],"n)":[162],"time":[164],"on":[165],"CRCW":[167],"PRAM":[168],"(thus":[169],"NC\u00b2)":[171],"known.":[173],"this":[176],"Logspace.":[179]},"counts_by_year":[],"updated_date":"2025-12-10T02:49:46.989445","created_date":"2025-12-10T00:00:00"}