{"id":"https://openalex.org/W2065008615","doi":"https://doi.org/10.1137/s0097539795288118","title":"Diagnosis of Wiring Networks: An Optimal Randomized Algorithm for Finding Connected Components of Unknown Graphs","display_name":"Diagnosis of Wiring Networks: An Optimal Randomized Algorithm for Finding Connected Components of Unknown Graphs","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2065008615","doi":"https://doi.org/10.1137/s0097539795288118","mag":"2065008615"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539795288118","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539795288118","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/A5078773079","display_name":"Weiping Shi","orcid":"https://orcid.org/0000-0001-9773-9255"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Weiping Shi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5017595199","display_name":"Douglas B. West","orcid":"https://orcid.org/0000-0001-8818-1667"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Douglas B. West","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.4848,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.66411491,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"28","issue":"5","first_page":"1541","last_page":"1551"},"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.9983000159263611,"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.9983000159263611,"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/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.9973999857902527,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7135857939720154},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6896231174468994},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.6690219640731812},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.6009250283241272},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5621271729469299},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.4769909977912903},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4608241319656372},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4419676959514618},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41188478469848633},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38718244433403015},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34102120995521545},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.30977320671081543}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7135857939720154},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6896231174468994},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.6690219640731812},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6009250283241272},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5621271729469299},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4769909977912903},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4608241319656372},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4419676959514618},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41188478469848633},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38718244433403015},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34102120995521545},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30977320671081543},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/s0097539795288118","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539795288118","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.15.6002","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.15.6002","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ece.tamu.edu/~wshi/pub/connect2.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.39.6472","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.6472","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.unt.edu/~wshi/connect2.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.49.5208","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.5208","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.uiuc.edu/~west/weiping3.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.50.3440","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.3440","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.unt.edu/~wshi/siam.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1979477906","https://openalex.org/W2002227553","https://openalex.org/W2022921915","https://openalex.org/W2059688607","https://openalex.org/W2096691973","https://openalex.org/W2098977057","https://openalex.org/W2110493715","https://openalex.org/W2115975433","https://openalex.org/W2295428206"],"related_works":["https://openalex.org/W3214012672","https://openalex.org/W2741543745","https://openalex.org/W2991815258","https://openalex.org/W1719252778","https://openalex.org/W4244487191","https://openalex.org/W2031098440","https://openalex.org/W2014512309","https://openalex.org/W4307385446","https://openalex.org/W4386875525","https://openalex.org/W2466894780"],"abstract_inverted_index":{"We":[0,24,78,115],"want":[1],"to":[2,46,51,58],"find":[3],"the":[4,39,43,53,60,104,111],"vertex":[5,16,61],"sets":[6],"of":[7,9,56,73,106,113],"components":[8],"a":[10,14,32,80,89],"graph":[11],"G":[12,27],"with":[13],"known":[15,69],"set":[17,22,34,62],"V":[18],"and":[19,38,88,108],"unknown":[20],"edge":[21],"E.":[23],"learn":[25],"about":[26],"by":[28],"sending":[29],"an":[30],"oracle":[31,40],"query":[33],"$S":[35],"\\subseteq":[36],"V$\\hspace*{-1pt},":[37],"tells":[41],"us":[42],"vertices":[44,107],"connected":[45],"S.":[47],"The":[48,65],"objective":[49],"is":[50,67,103,110],"use":[52],"minimum":[54],"number":[55,105,112],"queries":[57,87],"partition":[59],"into":[63],"components.":[64,114],"problem":[66],"also":[68,116],"as":[70],"interconnect":[71],"diagnosis":[72],"wiring":[74],"networks":[75],"in":[76],"VLSI.":[77],"present":[79],"deterministic":[81],"algorithm":[82,91],"using":[83,92],"O(min{k,":[84],"lg":[85,97,98],"n})":[86,99],"randomized":[90],"expected":[93],"O(min{k,lg":[94],"k":[95,109],"+":[96],"queries,":[100],"where":[101],"n":[102],"prove":[117],"matching":[118],"lower":[119],"bounds.":[120]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
