{"id":"https://openalex.org/W3097464473","doi":"https://doi.org/10.3390/a13120321","title":"Convert a Strongly Connected Directed Graph to a Black-and-White 3-SAT Problem by the Balatonbogl\u00e1r Model","display_name":"Convert a Strongly Connected Directed Graph to a Black-and-White 3-SAT Problem by the Balatonbogl\u00e1r Model","publication_year":2020,"publication_date":"2020-12-03","ids":{"openalex":"https://openalex.org/W3097464473","doi":"https://doi.org/10.3390/a13120321","mag":"3097464473"},"language":"en","primary_location":{"id":"doi:10.3390/a13120321","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13120321","pdf_url":"https://www.mdpi.com/1999-4893/13/12/321/pdf?version=1606986335","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/13/12/321/pdf?version=1606986335","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078475872","display_name":"G\u00e1bor Kusper","orcid":"https://orcid.org/0000-0001-6969-1629"},"institutions":[{"id":"https://openalex.org/I120832542","display_name":"Eszterhazy Karoly Catholic University","ror":"https://ror.org/004gfgx38","country_code":"HU","type":"education","lineage":["https://openalex.org/I120832542"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"G\u00e1bor Kusper","raw_affiliation_strings":["Faculty of Informatics, Eszterh\u00e1zy K\u00e1roly University, 3300 Eger, Hungary"],"affiliations":[{"raw_affiliation_string":"Faculty of Informatics, Eszterh\u00e1zy K\u00e1roly University, 3300 Eger, Hungary","institution_ids":["https://openalex.org/I120832542"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090729699","display_name":"Csaba B\u00edr\u00f3","orcid":"https://orcid.org/0000-0001-8561-9141"},"institutions":[{"id":"https://openalex.org/I120832542","display_name":"Eszterhazy Karoly Catholic University","ror":"https://ror.org/004gfgx38","country_code":"HU","type":"education","lineage":["https://openalex.org/I120832542"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Csaba Bir\u00f3","raw_affiliation_strings":["Faculty of Informatics, Eszterh\u00e1zy K\u00e1roly University, 3300 Eger, Hungary"],"affiliations":[{"raw_affiliation_string":"Faculty of Informatics, Eszterh\u00e1zy K\u00e1roly University, 3300 Eger, Hungary","institution_ids":["https://openalex.org/I120832542"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5078475872"],"corresponding_institution_ids":["https://openalex.org/I120832542"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.4222,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.69241877,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"13","issue":"12","first_page":"321","last_page":"321"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9853000044822693,"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/T10142","display_name":"Formal Methods in Verification","score":0.9853000044822693,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9782000184059143,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9749000072479248,"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/graph","display_name":"Graph","score":0.4908979535102844},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4906684160232544},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4864623248577118},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46640506386756897},{"id":"https://openalex.org/keywords/strongly-connected-component","display_name":"Strongly connected component","score":0.44912034273147583},{"id":"https://openalex.org/keywords/models-of-communication","display_name":"Models of communication","score":0.43232059478759766},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35803186893463135}],"concepts":[{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4908979535102844},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4906684160232544},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4864623248577118},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46640506386756897},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.44912034273147583},{"id":"https://openalex.org/C158156997","wikidata":"https://www.wikidata.org/wiki/Q1416645","display_name":"Models of communication","level":2,"score":0.43232059478759766},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35803186893463135},{"id":"https://openalex.org/C46312422","wikidata":"https://www.wikidata.org/wiki/Q11024","display_name":"Communication","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a13120321","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13120321","pdf_url":"https://www.mdpi.com/1999-4893/13/12/321/pdf?version=1606986335","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:5226be7589c447d68b146ef6331c6509","is_oa":true,"landing_page_url":"https://doaj.org/article/5226be7589c447d68b146ef6331c6509","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 13, Iss 12, p 321 (2020)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/13/12/321/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a13120321","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 13; Issue 12; Pages: 321","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a13120321","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13120321","pdf_url":"https://www.mdpi.com/1999-4893/13/12/321/pdf?version=1606986335","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.49000000953674316,"id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G2883714002","display_name":null,"funder_award_id":"GINOP-2.1.2-8-1-4-16-2017-00176","funder_id":"https://openalex.org/F4320328860","funder_display_name":"Magyarorsz\u00e1g Korm\u00e1nya"}],"funders":[{"id":"https://openalex.org/F4320328860","display_name":"Magyarorsz\u00e1g Korm\u00e1nya","ror":"https://ror.org/007ekx298"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3097464473.pdf","grobid_xml":"https://content.openalex.org/works/W3097464473.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W154780355","https://openalex.org/W1975335740","https://openalex.org/W1976379494","https://openalex.org/W2028206183","https://openalex.org/W2031823362","https://openalex.org/W2080267935","https://openalex.org/W2333976070","https://openalex.org/W2921616933","https://openalex.org/W2995524153","https://openalex.org/W3036523364","https://openalex.org/W3094965401","https://openalex.org/W3135386707","https://openalex.org/W6809029904"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2980963558","https://openalex.org/W1882246857","https://openalex.org/W3103304230","https://openalex.org/W2185360082","https://openalex.org/W1992365905","https://openalex.org/W1976691234","https://openalex.org/W3212023493","https://openalex.org/W2090715877","https://openalex.org/W2604729131"],"abstract_inverted_index":{"In":[0,47,78],"a":[1,69,88,94,102,189,203,209,214,257,260,264,285,289,296],"previous":[2],"paper":[3],"we":[4,50,81,126,249],"defined":[5],"the":[6,41,55,59,84,105,120,123,145,150,153,162,183,193,232,246,267,272,306],"black":[7,28,95,137,171],"and":[8,29,58,96,122,138,152,156,172,309],"white":[9,30,97,139,173],"SAT":[10,98,140,211,286,307],"problem":[11,191,212,287,308],"which":[12,117,262],"has":[13],"exactly":[14],"two":[15,52,300],"solutions,":[16],"where":[17,72],"each":[18],"variable":[19],"is":[20,68,93,118,148,182,253],"either":[21],"true":[22],"or":[23],"false.":[24],"We":[25,38,100,142,236,277],"showed":[26],"that":[27,83,113,128,144,251],"2-SAT":[31,190],"problems":[32],"represent":[33,284],"strongly":[34,89,132,166],"connected":[35,90,133,167],"directed":[36,70,195,215,234,290,310],"graphs.":[37,46,64,311],"presented":[39],"also":[40],"strong":[42,121,151,186,297],"model":[43,61,86,116,130,147,164,187,219,248,274],"of":[44,62,87,231,259,303],"communication":[45,63,66,91,134,168],"this":[48,79,129,293],"work":[49,80,294],"introduce":[51],"new":[53],"models,":[54,222],"weak":[56,85,124,154,218,268],"model,":[57,125,155,269],"Balatonbogl\u00e1r":[60,146,163,247,273],"A":[65],"graph":[67,92],"graph,":[71,196,291],"no":[73],"self":[74],"loops":[75],"are":[76],"allowed.":[77],"show":[82,143],"problem.":[99],"prove":[101],"powerful":[103],"theorem,":[104],"so":[106,161,197],"called":[107],"transitions":[108],"theorem.":[109],"This":[110],"theorem":[111],"states":[112],"for":[114],"any":[115],"between":[119,149,239,299],"have":[127,256],"represents":[131,165,225,263],"graphs":[135,169],"as":[136,170,288],"problems.":[141,175],"it":[157,198,224,252],"generates":[158,188,220],"3-SAT":[159,174],"problems,":[160],"Our":[176],"motivation":[177],"to":[178,207,241,255,270,283],"study":[179],"these":[180],"models":[181],"following:":[184],"The":[185,217],"from":[192],"input":[194,233],"does":[199],"not":[200,280],"give":[201],"us":[202],"deep":[204],"insight":[205],"how":[206,282],"convert":[208],"general":[210],"into":[213],"graph.":[216,235],"huge":[221],"because":[223],"all":[226],"cycles,":[227,230],"even":[228],"non-simple":[229],"need":[237],"something":[238],"them":[240],"gain":[242],"more":[243,275],"experience.":[244],"From":[245],"learned":[250],"enough":[254],"subset":[258],"clause,":[261],"cycle":[265],"in":[266],"make":[271],"compact.":[276],"still":[278],"do":[279],"know":[281],"but":[292],"gives":[295],"link":[298],"prominent":[301],"fields":[302],"formal":[304],"methods:":[305]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2020-11-09T00:00:00"}