{"id":"https://openalex.org/W1998301500","doi":"https://doi.org/10.1109/aict.2010.71","title":"Methods for Flow Graph Selection in Integral Network Coding","display_name":"Methods for Flow Graph Selection in Integral Network Coding","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W1998301500","doi":"https://doi.org/10.1109/aict.2010.71","mag":"1998301500"},"language":"en","primary_location":{"id":"doi:10.1109/aict.2010.71","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aict.2010.71","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Sixth Advanced International Conference on Telecommunications","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/A5016297278","display_name":"Mohammad Ravanbakhsh","orcid":null},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":true,"raw_author_name":"Mohammad Ravanbakhsh","raw_affiliation_strings":["Department of Informatics, University of Bergen, Bergen, Norway","[Dept. of Inf., Univ. of Bergen, Bergen, Norway]"],"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]},{"raw_affiliation_string":"[Dept. of Inf., Univ. of Bergen, Bergen, Norway]","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016839320","display_name":"Dag Haugland","orcid":"https://orcid.org/0000-0003-1110-3382"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Dag Haugland","raw_affiliation_strings":["Department of Informatics, University of Bergen, Bergen, Norway","[Dept. of Inf., Univ. of Bergen, Bergen, Norway]"],"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]},{"raw_affiliation_string":"[Dept. of Inf., Univ. of Bergen, Bergen, Norway]","institution_ids":["https://openalex.org/I4432739"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5016297278"],"corresponding_institution_ids":["https://openalex.org/I4432739"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11382282,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"292","last_page":"297"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":1.0,"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":1.0,"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/T12791","display_name":"Full-Duplex Wireless Communications","score":0.9670000076293945,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9452999830245972,"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/heuristics","display_name":"Heuristics","score":0.7775442600250244},{"id":"https://openalex.org/keywords/multicast","display_name":"Multicast","score":0.679623007774353},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6590542197227478},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5302987098693848},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.5117880702018738},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47927066683769226},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.46855244040489197},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.4632033109664917},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.43217337131500244},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4258015751838684},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.42462262511253357},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.412672758102417},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3772406280040741},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2598535418510437},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.1141825020313263},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07769212126731873}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7775442600250244},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.679623007774353},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6590542197227478},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5302987098693848},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.5117880702018738},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47927066683769226},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46855244040489197},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.4632033109664917},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.43217337131500244},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4258015751838684},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.42462262511253357},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.412672758102417},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3772406280040741},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2598535418510437},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.1141825020313263},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07769212126731873},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/aict.2010.71","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aict.2010.71","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Sixth Advanced International Conference on Telecommunications","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":11,"referenced_works":["https://openalex.org/W1489604929","https://openalex.org/W1970933841","https://openalex.org/W1977214195","https://openalex.org/W2002531683","https://openalex.org/W2048235391","https://openalex.org/W2105831729","https://openalex.org/W2114580785","https://openalex.org/W2123562143","https://openalex.org/W2171266829","https://openalex.org/W2187615109","https://openalex.org/W4213060883"],"related_works":["https://openalex.org/W2375873432","https://openalex.org/W4206915070","https://openalex.org/W2531764854","https://openalex.org/W2098682899","https://openalex.org/W102815760","https://openalex.org/W3161514703","https://openalex.org/W2141299097","https://openalex.org/W1851375266","https://openalex.org/W2610002854","https://openalex.org/W3141113327"],"abstract_inverted_index":{"The":[0,64],"search":[1],"for":[2,6],"optimal":[3],"multicast":[4],"subgraphs":[5],"network":[7],"coding":[8],"is":[9,28],"considered.":[10],"We":[11,53],"assume":[12],"unit":[13],"link":[14],"capacities":[15],"and":[16,73],"binary":[17],"flow":[18],"rates.":[19],"In":[20],"the":[21,25,32,35,43,62,86,92],"first":[22],"version":[23],"of":[24,34,61],"problem,":[26],"there":[27],"no":[29],"constraint":[30],"on":[31,68],"acyclicity":[33],"subgraphs,":[36],"whereas":[37],"such":[38],"constraints":[39],"are":[40,48,66,75],"imposed":[41],"in":[42],"second":[44],"version.":[45],"These":[46],"problems":[47],"known":[49,70],"to":[50,56,78,91],"be":[51],"NP-hard.":[52],"provide":[54],"heuristics":[55,65],"deal":[57],"with":[58],"both":[59],"versions":[60],"problem.":[63],"based":[67],"well":[69],"optimization":[71],"algorithms":[72],"they":[74],"therefore":[76],"easy":[77],"implement.":[79],"Through":[80],"numerical":[81],"experiments,":[82],"we":[83],"demonstrate":[84],"that":[85],"proposed":[87],"algorithm":[88],"performs":[89],"close":[90],"lower":[93],"bounds":[94],"obtained":[95],"from":[96],"relaxed":[97],"solutions.":[98]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}