{"id":"https://openalex.org/W2078868460","doi":"https://doi.org/10.1080/00207169508804410","title":"Minimal cycle cutset methods to solve constraint satisfaction problems","display_name":"Minimal cycle cutset methods to solve constraint satisfaction problems","publication_year":1995,"publication_date":"1995-01-01","ids":{"openalex":"https://openalex.org/W2078868460","doi":"https://doi.org/10.1080/00207169508804410","mag":"2078868460"},"language":"en","primary_location":{"id":"doi:10.1080/00207169508804410","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169508804410","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/A5110311173","display_name":"Uttom Chowdhury","orcid":null},"institutions":[{"id":"https://openalex.org/I145894827","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511","country_code":"IN","type":"education","lineage":["https://openalex.org/I145894827"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"U. Chowdhury","raw_affiliation_strings":["Department of Mathematics , Indian Institute of Technology , Kharagpur, 721302,  India"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics , Indian Institute of Technology , Kharagpur, 721302,  India","institution_ids":["https://openalex.org/I145894827"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101608029","display_name":"D. K. Gupta","orcid":"https://orcid.org/0009-0005-9776-7404"},"institutions":[{"id":"https://openalex.org/I145894827","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511","country_code":"IN","type":"education","lineage":["https://openalex.org/I145894827"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"D. K. Gupta","raw_affiliation_strings":["Department of Mathematics , Indian Institute of Technology , Kharagpur, 721302,  India"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics , Indian Institute of Technology , Kharagpur, 721302,  India","institution_ids":["https://openalex.org/I145894827"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5110311173"],"corresponding_institution_ids":["https://openalex.org/I145894827"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.2258708,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"57","issue":"1-2","first_page":"45","last_page":"55"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998999834060669,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998999834060669,"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/T11106","display_name":"Data Management and Algorithms","score":0.9890999794006348,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9869999885559082,"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/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6915801167488098},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5607784390449524},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.5569368600845337},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5468721389770508},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5127840638160706},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.46565017104148865},{"id":"https://openalex.org/keywords/constraint-graph","display_name":"Constraint graph","score":0.46033817529678345},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.40230751037597656},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39538130164146423},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39005693793296814},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35451993346214294},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.20061686635017395}],"concepts":[{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6915801167488098},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5607784390449524},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.5569368600845337},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5468721389770508},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5127840638160706},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.46565017104148865},{"id":"https://openalex.org/C178481205","wikidata":"https://www.wikidata.org/wiki/Q5164372","display_name":"Constraint graph","level":5,"score":0.46033817529678345},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.40230751037597656},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39538130164146423},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39005693793296814},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35451993346214294},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.20061686635017395},{"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/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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.1080/00207169508804410","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169508804410","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W52601056","https://openalex.org/W1514415888","https://openalex.org/W1970185999","https://openalex.org/W1999038767","https://openalex.org/W2002478775","https://openalex.org/W2021337406","https://openalex.org/W2061734130","https://openalex.org/W2068852367","https://openalex.org/W2080250034","https://openalex.org/W2088174216","https://openalex.org/W2095458137","https://openalex.org/W2151720296","https://openalex.org/W2984454117"],"related_works":["https://openalex.org/W1486916474","https://openalex.org/W2569549435","https://openalex.org/W2032348095","https://openalex.org/W115413730","https://openalex.org/W2737098235","https://openalex.org/W2091348864","https://openalex.org/W2784687883","https://openalex.org/W2141935412","https://openalex.org/W96881443","https://openalex.org/W2140769824"],"abstract_inverted_index":{"Dechter":[0],"[2]":[1],"has":[2],"proposed":[3],"a":[4,18,68,85,90,107],"cycle":[5,23,59,70,87],"cutset":[6,24,45,60,71,88],"method":[7,15],"to":[8,83],"solve":[9,78],"Constraint":[10],"Satisfaction":[11],"Problems":[12],"(CSPs).":[13],"This":[14,38],"arbitrarily":[16],"selects":[17],"set":[19],"of":[20,43,51,109],"nodes":[21,30],"as":[22],"and":[25,46,76],"hence":[26,47],"may":[27],"contain":[28],"some":[29],"which":[31],"does":[32],"not":[33],"lie":[34],"on":[35,101],"any":[36],"cycle.":[37],"will":[39],"increase":[40],"the":[41,44,48,52,73,79,112],"size":[42],"time":[49],"complexity":[50],"method.":[53],"In":[54],"this":[55],"paper,":[56],"two":[57],"minimal":[58,69,86],"methods":[61,65,98,114],"are":[62,92,99],"presented.":[63],"These":[64],"first":[66],"obtain":[67,84],"in":[72,89],"constraint":[74,110],"graph":[75,91],"then":[77],"CSP.":[80],"Two":[81],"algorithms":[82],"also":[93],"presented":[94],"here.":[95],"The":[96],"modified":[97,113],"tested":[100],"several":[102],"randomly":[103],"generated":[104],"CSPs.":[105],"On":[106],"class":[108],"graph,":[111],"almost":[115],"always":[116],"show":[117],"better":[118],"performance.":[119]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}