{"id":"https://openalex.org/W2576063853","doi":"https://doi.org/10.3233/sat190113","title":"Solution-Graphs of Boolean Formulas and Isomorphism1","display_name":"Solution-Graphs of Boolean Formulas and Isomorphism1","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2576063853","doi":"https://doi.org/10.3233/sat190113","mag":"2576063853"},"language":"en","primary_location":{"id":"doi:10.3233/sat190113","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190113","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190113?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190113","source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190113?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190113","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5072808081","display_name":"Patrick Scharpfenecker","orcid":"https://orcid.org/0000-0002-2479-9158"},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Patrick Scharpfenecker","raw_affiliation_strings":["University of Ulm, Institute of Theoretical Computer Science, Ulm, Germany. E-mails:\u00a0patrick.scharpfenecker@uni-ulm.de,\u00a0jacobo.toran@uni-ulm.de"],"affiliations":[{"raw_affiliation_string":"University of Ulm, Institute of Theoretical Computer Science, Ulm, Germany. E-mails:\u00a0patrick.scharpfenecker@uni-ulm.de,\u00a0jacobo.toran@uni-ulm.de","institution_ids":["https://openalex.org/I196349391"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027370903","display_name":"Jacobo Tor\u00e1n","orcid":"https://orcid.org/0000-0003-2168-4969"},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jacobo Tor\u00e1n","raw_affiliation_strings":["University of Ulm, Institute of Theoretical Computer Science, Ulm, Germany. E-mails:\u00a0patrick.scharpfenecker@uni-ulm.de,\u00a0jacobo.toran@uni-ulm.de"],"affiliations":[{"raw_affiliation_string":"University of Ulm, Institute of Theoretical Computer Science, Ulm, Germany. E-mails:\u00a0patrick.scharpfenecker@uni-ulm.de,\u00a0jacobo.toran@uni-ulm.de","institution_ids":["https://openalex.org/I196349391"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5072808081"],"corresponding_institution_ids":["https://openalex.org/I196349391"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00357068,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"10","issue":"1","first_page":"37","last_page":"58"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9954000115394592,"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.9925000071525574,"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/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.7774500846862793},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.733627438545227},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.6642240881919861},{"id":"https://openalex.org/keywords/hypercube","display_name":"Hypercube","score":0.5719260573387146},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5648360848426819},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5492498874664307},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5030826926231384},{"id":"https://openalex.org/keywords/isomorphism","display_name":"Isomorphism (crystallography)","score":0.49749353528022766},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.4873669743537903},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4238250255584717},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.37186744809150696},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2812689244747162},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.13329100608825684}],"concepts":[{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.7774500846862793},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.733627438545227},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.6642240881919861},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.5719260573387146},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5648360848426819},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5492498874664307},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5030826926231384},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.49749353528022766},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.4873669743537903},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4238250255584717},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.37186744809150696},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2812689244747162},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.13329100608825684},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"score":0.0},{"id":"https://openalex.org/C115624301","wikidata":"https://www.wikidata.org/wiki/Q895901","display_name":"Crystal structure","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3233/sat190113","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190113","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190113?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190113","source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"},{"id":"mag:2576063853","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc23.html#ScharpfeneckerT16","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"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":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":{"id":"doi:10.3233/sat190113","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190113","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190113?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190113","source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7058218711","display_name":null,"funder_award_id":"TO 200/3-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2576063853.pdf","grobid_xml":"https://content.openalex.org/works/W2576063853.grobid-xml"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W1535523293","https://openalex.org/W1560182867","https://openalex.org/W1574333603","https://openalex.org/W1618174268","https://openalex.org/W1974672137","https://openalex.org/W1980276492","https://openalex.org/W2006771561","https://openalex.org/W2031823362","https://openalex.org/W2033323875","https://openalex.org/W2039423976","https://openalex.org/W2063428816","https://openalex.org/W2115826669","https://openalex.org/W2166566648","https://openalex.org/W2488409468","https://openalex.org/W4236305466"],"related_works":["https://openalex.org/W2488409468","https://openalex.org/W2381264888","https://openalex.org/W1572204789","https://openalex.org/W2962948643","https://openalex.org/W2574893499","https://openalex.org/W3135578464","https://openalex.org/W2530575142","https://openalex.org/W1973860121","https://openalex.org/W2511773204","https://openalex.org/W2949149665","https://openalex.org/W3200877167","https://openalex.org/W2113598908","https://openalex.org/W2096098241","https://openalex.org/W2962821633","https://openalex.org/W2770854599","https://openalex.org/W2912875731","https://openalex.org/W2136923206","https://openalex.org/W1988965627","https://openalex.org/W2013054747","https://openalex.org/W1548432071"],"abstract_inverted_index":{"The":[0,25],"solution-graph":[1],"of":[2,12,22,27,33,46,67,75],"a":[3],"Boolean":[4],"formula":[5,70],"on":[6,50,63],"n":[7,16],"variables":[8],"is":[9,41],"the":[10,13,19,23,31,44,65,68,73,76,80],"subgraph":[11],"hypercube":[14],"H":[15],"induced":[17],"by":[18],"satisfying":[20],"assignments":[21],"formula.":[24],"structure":[26,66],"solution-graphs":[28],"has":[29],"been":[30],"object":[32],"much":[34],"research":[35],"in":[36,59,79],"recent":[37],"years":[38],"since":[39],"it":[40],"important":[42],"for":[43],"performance":[45],"SAT-solving":[47],"procedures":[48],"based":[49],"local":[51],"search.":[52],"Several":[53],"authors":[54],"have":[55],"studied":[56],"connectivity":[57,77],"problems":[58,78],"such":[60],"graphs":[61],"focusing":[62],"how":[64],"original":[69],"might":[71],"affect":[72],"complexity":[74],"solution-graph.":[81]},"counts_by_year":[],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}