{"id":"https://openalex.org/W1971163629","doi":"https://doi.org/10.1137/0404031","title":"NC Algorithms for Recognizing Partial 2-Trees and 3-Trees","display_name":"NC Algorithms for Recognizing Partial 2-Trees and 3-Trees","publication_year":1991,"publication_date":"1991-08-01","ids":{"openalex":"https://openalex.org/W1971163629","doi":"https://doi.org/10.1137/0404031","mag":"1971163629"},"language":"en","primary_location":{"id":"doi:10.1137/0404031","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0404031","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","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/A5081368387","display_name":"Daniel Granot","orcid":"https://orcid.org/0000-0001-5779-1032"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Daniel Granot","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5077605076","display_name":"Darko Skorin\u2010Kapov","orcid":"https://orcid.org/0000-0003-0723-4240"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Darko Skorin-Kapov","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0264,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.72307303,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"4","issue":"3","first_page":"342","last_page":"354"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9997000098228455,"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.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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6454582214355469},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6235792636871338},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5743290185928345},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.5653784275054932},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.5540571808815002},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.4872990846633911},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47171422839164734},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46462875604629517},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.45660901069641113},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.436705082654953},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.35548120737075806},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20542538166046143},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08076441287994385},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.06818100810050964}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6454582214355469},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6235792636871338},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5743290185928345},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.5653784275054932},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.5540571808815002},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.4872990846633911},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47171422839164734},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46462875604629517},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45660901069641113},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.436705082654953},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35548120737075806},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20542538166046143},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08076441287994385},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.06818100810050964},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0404031","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0404031","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","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":12,"referenced_works":["https://openalex.org/W1971826280","https://openalex.org/W1986824573","https://openalex.org/W1991755800","https://openalex.org/W1995040285","https://openalex.org/W1996419691","https://openalex.org/W2004350101","https://openalex.org/W2010837998","https://openalex.org/W2029448190","https://openalex.org/W2038674294","https://openalex.org/W2046904788","https://openalex.org/W2048013200","https://openalex.org/W2085550081"],"related_works":["https://openalex.org/W2142909216","https://openalex.org/W1568250663","https://openalex.org/W2491277646","https://openalex.org/W4300772499","https://openalex.org/W2593735092","https://openalex.org/W2950592963","https://openalex.org/W3003396734","https://openalex.org/W1964019173","https://openalex.org/W4386067568","https://openalex.org/W1543575092"],"abstract_inverted_index":{"The":[0],"existence":[1],"of":[2,37,50,62,65,82,130,135,155],"a":[3,6,13,22,33,38,59,66,83],"k-separator":[4],"in":[5,24,40,101,176],"partial":[7,51,68,84,156],"k-tree":[8,39,69,85],"graph":[9],"is":[10,17],"proved":[11],"and":[12,55,94,112,132,144,171],"linear":[14],"time":[15,106,165],"algorithm":[16,27,150],"constructed":[18,78],"that":[19,158],"finds":[20],"such":[21],"separator":[23],"k-trees.":[25],"This":[26],"can":[28],"be":[29],"used":[30,56],"to":[31,57],"obtain":[32],"balanced":[34,60],"binary":[35],"decomposition":[36,61],"$O(":[41,102,109,113,161,168,172],"n\\log":[42],"n":[43,104,163],")$":[44,105,111,116,164,170,174],"time.":[45],"Some":[46],"other":[47],"separation":[48],"properties":[49],"k-trees":[52,157],"are":[53,77],"derived":[54],"construct":[58],"an":[63],"embedding":[64],"k-connected":[67],"when":[70],"$k":[71,87,91,95,122],"=":[72,88,92,96,123],"2,3$.":[73,89],"Finally,":[74],"NC":[75],"algorithms":[76,99,120],"for":[79,86,121,151],"the":[80,119,127,136,152],"recognition":[81,154],"For":[90],"2$":[93],"3$":[97],"these":[98,177],"run":[100],"\\log^{2}":[103],"using,":[107],"respectively,":[108,167],"n^3":[110],"{n^4":[114],"}":[115],"processors.":[117],"Thus,":[118],"2,3$":[124],"improve":[125],"considerably":[126],"processor":[128],"bound":[129],"Chandrasekharan":[131],"Hedetniemi":[133],"[Proceedings":[134],"26th":[137],"Annual":[138],"Allerton":[139],"Conference":[140],"on":[141],"Communication,":[142],"Control":[143],"Computing,":[145],"1989,":[146],"pp.":[147],"283\u2013292]":[148],"general":[149],"parallel":[153],"would":[159],"require":[160],"\\log":[162],"and,":[166],"n^{10}":[169],"n^{12}":[173],"processors":[175],"cases.":[178]},"counts_by_year":[{"year":2013,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}