{"id":"https://openalex.org/W2057904195","doi":"https://doi.org/10.1002/net.3230140102","title":"On the np\u2010completeness of certain network testing problems","display_name":"On the np\u2010completeness of certain network testing problems","publication_year":1984,"publication_date":"1984-03-01","ids":{"openalex":"https://openalex.org/W2057904195","doi":"https://doi.org/10.1002/net.3230140102","mag":"2057904195"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230140102","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230140102","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5113452526","display_name":"Shimon Even","orcid":null},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"S. Even","raw_affiliation_strings":["Department of Computer Science, Technion, Haifa, Israel","Department of Computer Science, Technion, Haifa Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Department of Computer Science, Technion, Haifa Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013698877","display_name":"Oded Goldreich","orcid":"https://orcid.org/0000-0002-4329-135X"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"O. Goldreich","raw_affiliation_strings":["Department of Computer Science, Technion, Haifa, Israel","Department of Computer Science, Technion, Haifa Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Department of Computer Science, Technion, Haifa Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047793114","display_name":"Shay Moran","orcid":"https://orcid.org/0000-0002-8662-2737"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"S. Moran","raw_affiliation_strings":["Department of Computer Science, Technion, Haifa, Israel","Department of Computer Science, Technion, Haifa Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Department of Computer Science, Technion, Haifa Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110047184","display_name":"Po Tong","orcid":null},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]},{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["IL","US"],"is_corresponding":false,"raw_author_name":"P. Tong","raw_affiliation_strings":["Department of Computer Science, Technion, Haifa, Israel","University of California, Berkeley, California","Department of Computer Science, Technion, Haifa Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"University of California, Berkeley, California","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"Department of Computer Science, Technion, Haifa Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":4.8968,"has_fulltext":false,"cited_by_count":103,"citation_normalized_percentile":{"value":0.95717836,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"14","issue":"1","first_page":"1","last_page":"24"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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/T12288","display_name":"Optimization and Search Problems","score":0.9922999739646912,"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.9919000267982483,"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.6542875170707703},{"id":"https://openalex.org/keywords/transmitter","display_name":"Transmitter","score":0.6339470744132996},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5439867377281189},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.505772590637207},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4769541025161743},{"id":"https://openalex.org/keywords/axiom","display_name":"Axiom","score":0.46114712953567505},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.45117348432540894},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4466099739074707},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44467687606811523},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44018301367759705},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.43830758333206177},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4176829159259796},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.405515193939209},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35078901052474976},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1254386007785797},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12181729078292847}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6542875170707703},{"id":"https://openalex.org/C47798520","wikidata":"https://www.wikidata.org/wiki/Q190157","display_name":"Transmitter","level":3,"score":0.6339470744132996},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5439867377281189},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.505772590637207},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4769541025161743},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.46114712953567505},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.45117348432540894},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4466099739074707},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44467687606811523},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44018301367759705},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.43830758333206177},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4176829159259796},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.405515193939209},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35078901052474976},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1254386007785797},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12181729078292847},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230140102","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230140102","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/W1655990431","https://openalex.org/W2003813631","https://openalex.org/W2011039300","https://openalex.org/W2068155033","https://openalex.org/W2102669784","https://openalex.org/W2120729889","https://openalex.org/W2157529519"],"related_works":["https://openalex.org/W2355663289","https://openalex.org/W2106913410","https://openalex.org/W4380372336","https://openalex.org/W2354248671","https://openalex.org/W2359134391","https://openalex.org/W2947628004","https://openalex.org/W2594116857","https://openalex.org/W2935229758","https://openalex.org/W2352791832","https://openalex.org/W2142305280"],"abstract_inverted_index":{"Abstract":[0],"Let":[1],"G":[2],"(":[3],"V,":[4],"E":[5],")":[6],"be":[7,26,46,52,174],"an":[8,186],"undirected":[9],"graph":[10],"which":[11,145,191,200],"describes":[12],"the":[13,20,31,49,60,63,66,79,107,114,126,134,158,171,201,204],"structure":[14],"of":[15,30,42,106,117,129,161,203],"a":[16,47,53,57,83,88,92,96,142,181],"communication":[17,74],"network.":[18],"During":[19],"maintenance":[21],"period":[22,143],"every":[23],"line":[24,36],"must":[25],"tested":[27,38],"in":[28,144,154],"each":[29,105],"two":[32,80,101,109],"possible":[33],"directions.":[34],"A":[35],"is":[37,113,125,207],"by":[39,138,176],"assigning":[40],"one":[41,119],"its":[43],"endpoints":[44],"to":[45,51,62,78,179],"transmitter,":[48],"other":[50],"receiver,":[54],"and":[55,90,95,123],"sending":[56],"message":[58],"from":[59],"transmitter":[61,89],"receiver":[64,93],"through":[65,100],"line.":[67],"We":[68,151],"define":[69],"several":[70],"different":[71],"models":[72,170],"for":[73,132,190,199],"networks,":[75],"all":[76],"subject":[77],"following":[81],"axioms:":[82],"vertex":[84,97],"cannot":[85,98],"act":[86],"as":[87,91],"simultaneously":[94],"receive":[99],"lines":[102,118],"simultaneously.":[103,150],"In":[104,168],"models,":[108,156],"problems":[110,165,172],"arise:":[111],"What":[112,124],"maximum":[115,182],"number":[116,128],"can":[120,173],"test":[121],"simultaneously?":[122],"minimum":[127],"phases":[130],"necessary":[131],"testing":[133],"entire":[135],"network?,":[136],"where,":[137],"\u201cphase\u201d":[139],"we":[140],"mean":[141],"some":[146,169],"tests":[147],"are":[148,166,194],"conducted":[149],"show":[152],"that":[153],"most":[155],"including":[157],"\u201cnatural\u201d":[159],"model":[160,197],"radio":[162],"communication,":[163],"both":[164],"NP\u2010hard.":[167],"solved":[175],"reducing":[177],"them":[178],"either":[180],"matching":[183],"problem":[184,189,206],"or":[185],"edge":[187],"coloring":[188],"polynomial":[192],"algorithms":[193],"known.":[195],"One":[196],"remains":[198],"complexity":[202],"minimization":[205],"unknown.":[208]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}