{"id":"https://openalex.org/W2149392423","doi":"https://doi.org/10.1137/s0097539793283151","title":"A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity","display_name":"A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity","publication_year":1998,"publication_date":"1998-10-01","ids":{"openalex":"https://openalex.org/W2149392423","doi":"https://doi.org/10.1137/s0097539793283151","mag":"2149392423"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539793283151","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793283151","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5112615289","display_name":"Greg Barnes","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Greg Barnes","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103756864","display_name":"Jonathan F. Buss","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jonathan F. Buss","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086685720","display_name":"Walter L. Ruzzo","orcid":"https://orcid.org/0000-0002-6260-2926"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Walter L. Ruzzo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5089964489","display_name":"Baruch Schieber","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Baruch Schieber","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":1.5734,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.86751915,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"27","issue":"5","first_page":"1273","last_page":"1282"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9969000220298767,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9969000220298767,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.996399998664856,"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/T10083","display_name":"Graphene research and applications","score":0.9930999875068665,"subfield":{"id":"https://openalex.org/subfields/2505","display_name":"Materials Chemistry"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.800818920135498},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7384830713272095},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6547157764434814},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6386686563491821},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.629784107208252},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.577412486076355},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.47729337215423584},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47246670722961426},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4714684784412384},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.447339802980423},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39598193764686584},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31467440724372864},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22268527746200562},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.205835223197937}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.800818920135498},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7384830713272095},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6547157764434814},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6386686563491821},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.629784107208252},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.577412486076355},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.47729337215423584},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47246670722961426},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4714684784412384},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.447339802980423},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39598193764686584},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31467440724372864},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22268527746200562},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.205835223197937},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539793283151","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793283151","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1975937255","https://openalex.org/W1982129592","https://openalex.org/W2002818110","https://openalex.org/W2027188157","https://openalex.org/W2039302045","https://openalex.org/W2064136209","https://openalex.org/W2337498233"],"related_works":["https://openalex.org/W4308171630","https://openalex.org/W4205594610","https://openalex.org/W3190612612","https://openalex.org/W1968954131","https://openalex.org/W2082636129","https://openalex.org/W2982557863","https://openalex.org/W2925112333","https://openalex.org/W2539729130","https://openalex.org/W2075449032","https://openalex.org/W2583998759"],"abstract_inverted_index":{"Directed":[0],"s-t":[1,36],"connectivity":[2],"is":[3,10],"the":[4,25],"problem":[5],"of":[6],"detecting":[7],"whether":[8],"there":[9],"a":[11,20],"path":[12],"from":[13],"vertex":[14,17],"s":[15],"to":[16],"t":[18],"in":[19,54],"directed":[21,35],"graph.":[22],"We":[23],"present":[24],"first":[26],"known":[27],"deterministic":[28],"sublinear":[29],"space,":[30],"polynomial":[31,55],"time":[32],"algorithm":[33,42],"for":[34],"connectivity.":[37],"For":[38],"n-vertex":[39],"graphs,":[40],"our":[41],"can":[43],"use":[44],"as":[45,47],"little":[46],"$n/2^{\\Theta(\\sqrt{\\log":[48],"n})}$":[49],"space":[50],"while":[51],"still":[52],"running":[53],"time.":[56]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}