{"id":"https://openalex.org/W2962914619","doi":"https://doi.org/10.1109/isit.2015.7282667","title":"Subgraph domatic problem and writing capacity of memory devices with restricted state transitions","display_name":"Subgraph domatic problem and writing capacity of memory devices with restricted state transitions","publication_year":2015,"publication_date":"2015-06-01","ids":{"openalex":"https://openalex.org/W2962914619","doi":"https://doi.org/10.1109/isit.2015.7282667","mag":"2962914619"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2015.7282667","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282667","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-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/A5049268989","display_name":"Tadashi Wadayama","orcid":null},"institutions":[{"id":"https://openalex.org/I197274945","display_name":"Nagoya Institute of Technology","ror":"https://ror.org/055yf1005","country_code":"JP","type":"education","lineage":["https://openalex.org/I197274945"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Tadashi Wadayama","raw_affiliation_strings":["Nagoya Institute of Technology, Japan"],"affiliations":[{"raw_affiliation_string":"Nagoya Institute of Technology, Japan","institution_ids":["https://openalex.org/I197274945"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101050681","display_name":"Taisuke Izumi","orcid":null},"institutions":[{"id":"https://openalex.org/I197274945","display_name":"Nagoya Institute of Technology","ror":"https://ror.org/055yf1005","country_code":"JP","type":"education","lineage":["https://openalex.org/I197274945"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Taisuke Izumi","raw_affiliation_strings":["Nagoya Kogyo Daigaku, Nagoya, Aichi, JP"],"affiliations":[{"raw_affiliation_string":"Nagoya Kogyo Daigaku, Nagoya, Aichi, JP","institution_ids":["https://openalex.org/I197274945"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045038367","display_name":"Hirotaka Ono","orcid":"https://orcid.org/0000-0003-0845-3947"},"institutions":[{"id":"https://openalex.org/I135598925","display_name":"Kyushu University","ror":"https://ror.org/00p4k0j84","country_code":"JP","type":"education","lineage":["https://openalex.org/I135598925"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hirotaka Ono","raw_affiliation_strings":["Kyushu University, Japan"],"affiliations":[{"raw_affiliation_string":"Kyushu University, Japan","institution_ids":["https://openalex.org/I135598925"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5049268989"],"corresponding_institution_ids":["https://openalex.org/I197274945"],"apc_list":null,"apc_paid":null,"fwci":1.2943,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.87334945,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1307","last_page":"1311"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11567","display_name":"semigroups and automata theory","score":0.9969000220298767,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9966999888420105,"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/lemma","display_name":"Lemma (botany)","score":0.5856159329414368},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5748602747917175},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.527463436126709},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5105003118515015},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.5087733864784241},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.49717429280281067},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49311086535453796},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.48091432452201843},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.46229690313339233},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4287116825580597},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3410072922706604},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2459113895893097},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.2065332531929016},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1561024785041809}],"concepts":[{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.5856159329414368},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5748602747917175},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.527463436126709},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5105003118515015},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.5087733864784241},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.49717429280281067},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49311086535453796},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.48091432452201843},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.46229690313339233},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4287116825580597},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3410072922706604},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2459113895893097},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.2065332531929016},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1561024785041809},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2015.7282667","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282667","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","score":0.49000000953674316,"display_name":"Quality Education"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1515157528","https://openalex.org/W1970221790","https://openalex.org/W1970857699","https://openalex.org/W2011039300","https://openalex.org/W2057383973","https://openalex.org/W2068871408","https://openalex.org/W2076639947","https://openalex.org/W2091659991","https://openalex.org/W2112058620","https://openalex.org/W2122406806","https://openalex.org/W2147064651","https://openalex.org/W2147248622","https://openalex.org/W2151834530","https://openalex.org/W2496163386","https://openalex.org/W2501218950","https://openalex.org/W6610072603","https://openalex.org/W6643108424","https://openalex.org/W6671775065","https://openalex.org/W6682001274"],"related_works":["https://openalex.org/W4225909815","https://openalex.org/W2573312512","https://openalex.org/W1553272085","https://openalex.org/W4291316360","https://openalex.org/W2481425642","https://openalex.org/W2187892513","https://openalex.org/W2357418035","https://openalex.org/W2012122180","https://openalex.org/W398688634","https://openalex.org/W1966879981"],"abstract_inverted_index":{"A":[0,150],"code":[1],"design":[2],"problem":[3,17,54],"for":[4,68,128],"memory":[5],"devices":[6],"with":[7],"restricted":[8],"state":[9,34,91],"transitions":[10],"is":[11,19,44,55,101,117,135,145],"formulated":[12],"as":[13],"a":[14,21,32,52,69,72],"combinatorial":[15],"optimization":[16],"that":[18,61,90],"called":[20],"subgraph":[22,70],"domatic":[23],"partition":[24],"(subDP)":[25],"problem.":[26],"If":[27],"any":[28],"neighbor":[29],"set":[30],"of":[31,51,66,71,78,89,110,123,130,148],"given":[33,73,136],"transition":[35,92],"graph":[36],"contains":[37],"all":[38],"the":[39,42,58,63,86,120,124,146,163],"colors,":[40],"then":[41],"coloring":[43,60,84],"said":[45],"to":[46,56,103,118],"be":[47,104],"valid.":[48],"The":[49,76,94],"goal":[50],"subDP":[53,95],"find":[57],"valid":[59,83],"has":[62],"largest":[64],"number":[65,77,147],"colors":[67,79],"directed":[74],"graph.":[75,93],"in":[80,106,114,161],"an":[81,158],"optimal":[82],"indicates":[85],"writing":[87,125],"capacity":[88,126],"problems":[96],"are":[97],"computationally":[98],"hard;":[99],"it":[100],"proved":[102],"NP-complete":[105],"this":[107,115,134],"paper.":[108],"One":[109],"our":[111],"main":[112],"contributions":[113],"paper":[116],"show":[119],"asymptotic":[121,164],"behavior":[122],"C(G)":[127,138],"sequences":[129],"dense":[131],"bidirectional":[132],"graphs;":[133],"by":[137],"=":[139],"\u03a9(n/":[140],"ln":[141],"n),":[142],"where":[143],"n":[144],"nodes.":[149],"probabilistic":[151],"method,":[152],"Lov\u00e1sz":[153],"local":[154],"lemma":[155],"(LLL),":[156],"plays":[157],"essential":[159],"role":[160],"deriving":[162],"expression.":[165]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}