{"id":"https://openalex.org/W2339549643","doi":"https://doi.org/10.1109/allerton.2015.7447145","title":"On the computational complexity of the solvability of information flow problem with hierarchy constraint","display_name":"On the computational complexity of the solvability of information flow problem with hierarchy constraint","publication_year":2015,"publication_date":"2015-09-01","ids":{"openalex":"https://openalex.org/W2339549643","doi":"https://doi.org/10.1109/allerton.2015.7447145","mag":"2339549643"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2015.7447145","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2015.7447145","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","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/A5034827550","display_name":"Yuki Takeda","orcid":null},"institutions":[{"id":"https://openalex.org/I75917431","display_name":"Nara Institute of Science and Technology","ror":"https://ror.org/05bhada84","country_code":"JP","type":"education","lineage":["https://openalex.org/I75917431"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yuki Takeda","raw_affiliation_strings":["Nara Sentan Kagaku Gijutsu Daigakuin Daigaku, Ikoma, Nara, JP"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nara Sentan Kagaku Gijutsu Daigakuin Daigaku, Ikoma, Nara, JP","institution_ids":["https://openalex.org/I75917431"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113863452","display_name":"Yuichi Kaji","orcid":null},"institutions":[{"id":"https://openalex.org/I75917431","display_name":"Nara Institute of Science and Technology","ror":"https://ror.org/05bhada84","country_code":"JP","type":"education","lineage":["https://openalex.org/I75917431"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yuichi Kaji","raw_affiliation_strings":["Nara Sentan Kagaku Gijutsu Daigakuin Daigaku, Ikoma, Nara, JP"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nara Sentan Kagaku Gijutsu Daigakuin Daigaku, Ikoma, Nara, JP","institution_ids":["https://openalex.org/I75917431"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113923123","display_name":"Minoru Ito","orcid":null},"institutions":[{"id":"https://openalex.org/I75917431","display_name":"Nara Institute of Science and Technology","ror":"https://ror.org/05bhada84","country_code":"JP","type":"education","lineage":["https://openalex.org/I75917431"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Minoru Ito","raw_affiliation_strings":["Nara Institute of Science and Technology, Ikoma-shi, Nara, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nara Institute of Science and Technology, Ikoma-shi, Nara, Japan","institution_ids":["https://openalex.org/I75917431"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.20708751,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1205","last_page":"1210"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","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/T10796","display_name":"Cooperative Communication and Network Coding","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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.993399977684021,"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/T11478","display_name":"Caching and Content Delivery","score":0.986299991607666,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.7603822946548462},{"id":"https://openalex.org/keywords/information-flow","display_name":"Information flow","score":0.6893140077590942},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6079275608062744},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.5792967677116394},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.571864902973175},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5620659589767456},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.548025369644165},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.5420809984207153},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4762061834335327},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.459085613489151},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4089323878288269},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3861583471298218},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2989209294319153},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08122318983078003}],"concepts":[{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.7603822946548462},{"id":"https://openalex.org/C2779136372","wikidata":"https://www.wikidata.org/wiki/Q10283002","display_name":"Information flow","level":2,"score":0.6893140077590942},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6079275608062744},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5792967677116394},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.571864902973175},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5620659589767456},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.548025369644165},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.5420809984207153},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4762061834335327},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.459085613489151},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4089323878288269},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3861583471298218},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2989209294319153},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08122318983078003},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/allerton.2015.7447145","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2015.7447145","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W2016444590","https://openalex.org/W2105781905","https://openalex.org/W2105831729","https://openalex.org/W2106403318","https://openalex.org/W2165268768","https://openalex.org/W4242163204","https://openalex.org/W6654396071"],"related_works":["https://openalex.org/W4231500168","https://openalex.org/W90079504","https://openalex.org/W2032436423","https://openalex.org/W3141113327","https://openalex.org/W3035974271","https://openalex.org/W1561045713","https://openalex.org/W2374451529","https://openalex.org/W2069541586","https://openalex.org/W1553098308","https://openalex.org/W2080904092"],"abstract_inverted_index":{"An":[0],"information":[1,8,30,49,62,84,94,133],"flow":[2,31,50,63,85,95,134],"problem":[3,54,135],"discusses":[4,124],"how":[5,39],"to":[6,67,81,149],"transport":[7],"over":[9],"a":[10,17,26,72,79,118],"complicated":[11],"network.":[12],"It":[13],"is":[14,35,58,66,71],"known":[15],"that":[16,76,154],"linear":[18,41,73],"network":[19,42,74],"code":[20,75],"plays":[21],"an":[22,110,132],"essential":[23],"role":[24],"in":[25,97],"certain":[27],"type":[28],"of":[29,48,61,93,99,104,112,121,128,131,142,151],"problems,":[32,64],"but":[33],"it":[34],"not":[36],"understood":[37],"clearly":[38],"contributing":[40],"codes":[43],"are":[44,144],"for":[45],"other":[46],"types":[47],"problems.":[51],"One":[52],"basic":[53],"concerning":[55],"this":[56,115],"aspect":[57],"the":[59,82,91,102,125,129,137],"solvability":[60,92,130],"which":[65],"decide":[68],"if":[69],"there":[70],"can":[77],"be":[78],"solution":[80],"given":[83],"problem.":[86],"Lehman":[87,158],"et":[88,159],"al.":[89,160],"characterize":[90],"problems":[96,143],"terms":[98],"constraints":[100],"on":[101],"sets":[103],"source":[105],"and":[106,123,147],"sink":[107],"nodes.":[108],"As":[109],"extension":[111],"Lehman's":[113],"investigation,":[114],"study":[116],"introduces":[117],"hierarchy":[119,138],"constraint":[120],"messages,":[122],"computational":[126],"complexity":[127],"with":[136],"constraints.":[139],"Nine":[140],"classes":[141],"newly":[145],"defined,":[146],"classified":[148],"one":[150],"three":[152],"categories":[153],"were":[155],"discovered":[156],"by":[157]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}