乐胖代购免代理版

{"id":"https://openalex.org/W2162642177","doi":"https://doi.org/10.1109/iccta.2007.133","title":"What Graphs can be Efficiently Represented by BDDs?","display_name":"What Graphs can be Efficiently Represented by BDDs?","publication_year":2007,"publication_date":"2007-03-01","ids":{"openalex":"https://openalex.org/W2162642177","doi":"https://doi.org/10.1109/iccta.2007.133","mag":"2162642177"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccta.2007.133","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5072808827","display_name":"Changxing Dong","orcid":"https://orcid.org/0000-0002-4578-8036"},"institutions":[{"id":"https://openalex.org/I68956291","display_name":"Martin Luther University Halle-Wittenberg","ror":"https://ror.org/05gqaka33","country_code":"DE","type":"education","lineage":["https://openalex.org/I68956291"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"C. Dong","raw_affiliation_strings":["Institute of Computer Science, Martin Luther University of Halle-Wittenberg, Halle, Germany"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, Martin Luther University of Halle-Wittenberg, Halle, Germany","institution_ids":["https://openalex.org/I68956291"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007586603","display_name":"Paul Molitor","orcid":"https://orcid.org/0000-0003-1461-7936"},"institutions":[{"id":"https://openalex.org/I68956291","display_name":"Martin Luther University Halle-Wittenberg","ror":"https://ror.org/05gqaka33","country_code":"DE","type":"education","lineage":["https://openalex.org/I68956291"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"P. Molitor","raw_affiliation_strings":["Institute of Computer Science, Martin Luther University of Halle-Wittenberg, Halle, Germany"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, Martin Luther University of Halle-Wittenberg, Halle, Germany","institution_ids":["https://openalex.org/I68956291"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.583,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":2,"citation_normalized_percentile":{"value":0.229858,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":70,"max":73},"biblio":{"volume":null,"issue":null,"first_page":"128","last_page":"134"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9935,"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.9935,"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.9424,"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/T11476","display_name":"Graph theory and applications","score":0.9292,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/binary-decision-diagram","display_name":"Binary decision diagram","score":0.6311237},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.5568432},{"id":"https://openalex.org/keywords/modular-decomposition","display_name":"Modular decomposition","score":0.44250098},{"id":"https://openalex.org/keywords/graph-product","display_name":"Graph product","score":0.43861237}],"concepts":[{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.6311237},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.5568432},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5545984},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.52541757},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48438627},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47434607},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.44250098},{"id":"https://openalex.org/C68103157","wikidata":"https://www.wikidata.org/wiki/Q569347","display_name":"Graph product","level":5,"score":0.43861237},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4094627},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38068452},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36786398},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3514939},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.3314519},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.15879887}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccta.2007.133","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.75,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, justice, and strong institutions"}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":17,"referenced_works":["https://openalex.org/W143396352","https://openalex.org/W1488809080","https://openalex.org/W1517585663","https://openalex.org/W1596778355","https://openalex.org/W1664822802","https://openalex.org/W168333749","https://openalex.org/W1975335740","https://openalex.org/W2020944181","https://openalex.org/W2030224590","https://openalex.org/W2054195481","https://openalex.org/W2076801642","https://openalex.org/W2080267935","https://openalex.org/W2107864677","https://openalex.org/W2149479807","https://openalex.org/W2491288706","https://openalex.org/W4285719527","https://openalex.org/W4299835756"],"related_works":["https://openalex.org/W4385414273","https://openalex.org/W4293578199","https://openalex.org/W416686103","https://openalex.org/W3130332934","https://openalex.org/W2986079166","https://openalex.org/W2362011785","https://openalex.org/W2230314777","https://openalex.org/W1974513303","https://openalex.org/W1919313975","https://openalex.org/W1769730578"],"abstract_inverted_index":{"We":[0,19],"have":[1],"carried":[2],"out":[3],"experimental":[4],"research":[5],"into":[6,118],"implicit":[7],"representation":[8],"of":[9,34,50,61,72,88,91,102,107,143],"large":[10,74],"graphs":[11,24,30,65,75],"using":[12],"reduced":[13],"ordered":[14],"binary":[15],"decision":[16],"diagrams":[17],"(OBDDs).":[18],"experimentally":[20],"show":[21],"that":[22,70,130],"for":[23],"from":[25,58],"real":[26],"applications":[27],"such":[28],"as":[29],"representing":[31],"the":[32,35,38,48,51,59,64,83,86,89,95,100,105,108,119,141],"networks":[33,47],"Internet":[36],"or":[37],"World":[39],"Wide":[40],"Web":[41],"and":[42,45,104,135],"other":[43],"technical":[44],"social":[46],"sizes":[49],"corresponding":[52],"OBDDs":[53,125],"do":[54],"not":[55],"differ":[56],"much":[57],"number":[60,90,101],"edges":[62,93],"which":[63],"contain.":[66],"It":[67],"is":[68,137],"noteworthy":[69],"all":[71],"these":[73],"are":[76,126],"sparse.":[77],"For":[78],"randomly":[79],"generated":[80],"dense":[81],"graphs,":[82],"gain,":[84],"i.e.,":[85],"ratio":[87],"graph":[92,116],"to":[94,112],"OBDD":[96],"size,":[97],"increases":[98],"with":[99],"vertices":[103],"density":[106],"graphs.":[109],"The":[110],"importance":[111],"know":[113],"whether":[114],"a":[115],"falls":[117],"region":[120],"where":[121],"algorithms":[122],"based":[123,131],"on":[124,132],"more":[127],"efficient":[128],"than":[129],"adjacent":[133],"lists":[134],"matrices":[136],"therefore":[138],"emphasized":[139],"through":[140],"results":[142],"this":[144],"paper":[145]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2162642177","counts_by_year":[],"updated_date":"2024-12-28T20:43:43.769308","created_date":"2016-06-24"}