{"id":"https://openalex.org/W1996736446","doi":"https://doi.org/10.1080/00207169108804025","title":"A simple nc recognition algorithm for welsh-powell opposition graphs","display_name":"A simple nc recognition algorithm for welsh-powell opposition graphs","publication_year":1991,"publication_date":"1991-01-01","ids":{"openalex":"https://openalex.org/W1996736446","doi":"https://doi.org/10.1080/00207169108804025","mag":"1996736446"},"language":"en","primary_location":{"id":"doi:10.1080/00207169108804025","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169108804025","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer 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/A5111978431","display_name":"Didier Link","orcid":null},"institutions":[{"id":"https://openalex.org/I81365321","display_name":"Old Dominion University","ror":"https://ror.org/04zjtrb98","country_code":"US","type":"education","lineage":["https://openalex.org/I81365321"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. Link","raw_affiliation_strings":["Department of Computer Science , Old Dominion University , Norfolk, VA,  23529-0162,  U.S.A","Department of Computer Science, Old Dominion University, Norfolk, VA 23529\u20100162, U.S.A"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science , Old Dominion University , Norfolk, VA,  23529-0162,  U.S.A","institution_ids":["https://openalex.org/I81365321"]},{"raw_affiliation_string":"Department of Computer Science, Old Dominion University, Norfolk, VA 23529\u20100162, U.S.A","institution_ids":["https://openalex.org/I81365321"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111426029","display_name":"S. Olariu","orcid":null},"institutions":[{"id":"https://openalex.org/I81365321","display_name":"Old Dominion University","ror":"https://ror.org/04zjtrb98","country_code":"US","type":"education","lineage":["https://openalex.org/I81365321"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Olariu","raw_affiliation_strings":["Department of Computer Science , Old Dominion University , Norfolk, VA,  23529-0162,  U.S.A","Department of Computer Science, Old Dominion University, Norfolk, VA 23529\u20100162, U.S.A"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science , Old Dominion University , Norfolk, VA,  23529-0162,  U.S.A","institution_ids":["https://openalex.org/I81365321"]},{"raw_affiliation_string":"Department of Computer Science, Old Dominion University, Norfolk, VA 23529\u20100162, U.S.A","institution_ids":["https://openalex.org/I81365321"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.12150361,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"41","issue":"1-2","first_page":"49","last_page":"53"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9950000047683716,"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.9950000047683716,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.991599977016449,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9506000280380249,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/welsh","display_name":"Welsh","score":0.8421752452850342},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.6030591726303101},{"id":"https://openalex.org/keywords/opposition","display_name":"Opposition (politics)","score":0.5271049737930298},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5086880326271057},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5042654275894165},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4581001102924347},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.44183623790740967},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.41112494468688965},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36181849241256714},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.17686673998832703},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.07447654008865356},{"id":"https://openalex.org/keywords/law","display_name":"Law","score":0.05219271779060364},{"id":"https://openalex.org/keywords/political-science","display_name":"Political science","score":0.05141633749008179}],"concepts":[{"id":"https://openalex.org/C2780769345","wikidata":"https://www.wikidata.org/wiki/Q9309","display_name":"Welsh","level":2,"score":0.8421752452850342},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.6030591726303101},{"id":"https://openalex.org/C2780668109","wikidata":"https://www.wikidata.org/wiki/Q192852","display_name":"Opposition (politics)","level":3,"score":0.5271049737930298},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5086880326271057},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5042654275894165},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4581001102924347},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.44183623790740967},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.41112494468688965},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36181849241256714},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.17686673998832703},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.07447654008865356},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.05219271779060364},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.05141633749008179},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207169108804025","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169108804025","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W2005874499","https://openalex.org/W2012304296","https://openalex.org/W2108301529","https://openalex.org/W2143474538","https://openalex.org/W2320198223","https://openalex.org/W4256581173"],"related_works":["https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W1827895227","https://openalex.org/W4285104409","https://openalex.org/W4210317843"],"abstract_inverted_index":{"The":[0],"Welsh-Powell":[1],"opposition":[2],"graphs":[3,9,30],"have":[4],"been":[5],"shown":[6],"to":[7],"be":[8],"for":[10,26,35],"which":[11],"a":[12,23],"certain":[13],"greedy":[14],"heuristic":[15],"results":[16],"in":[17],"an":[18,40],"optimum":[19],"colouring.":[20],"We":[21],"propose":[22],"new":[24],"characterization":[25],"this":[27,33],"class":[28],"of":[29,38],"and":[31],"exploit":[32],"result":[34],"the":[36],"purpose":[37],"obtaining":[39],"efficient":[41],"NC":[42],"recognition":[43],"algorithm.":[44]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}