{"id":"https://openalex.org/W2997527678","doi":"https://doi.org/10.1109/icct46805.2019.8947124","title":"Graph Theory Algorithm for Clustered Interference Alignment","display_name":"Graph Theory Algorithm for Clustered Interference Alignment","publication_year":2019,"publication_date":"2019-10-01","ids":{"openalex":"https://openalex.org/W2997527678","doi":"https://doi.org/10.1109/icct46805.2019.8947124","mag":"2997527678"},"language":"en","primary_location":{"id":"doi:10.1109/icct46805.2019.8947124","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icct46805.2019.8947124","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 19th International Conference on Communication Technology (ICCT)","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/A5021356386","display_name":"Jiashi Wang","orcid":"https://orcid.org/0000-0002-5581-9035"},"institutions":[{"id":"https://openalex.org/I41198531","display_name":"Nanjing University of Posts and Telecommunications","ror":"https://ror.org/043bpky34","country_code":"CN","type":"education","lineage":["https://openalex.org/I41198531"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jiashi Wang","raw_affiliation_strings":["College of Electronic and Optical Engineering and College of Microelectronics, Nanjing University of Posts and Telecommunications, Nanjing, China"],"affiliations":[{"raw_affiliation_string":"College of Electronic and Optical Engineering and College of Microelectronics, Nanjing University of Posts and Telecommunications, Nanjing, China","institution_ids":["https://openalex.org/I41198531"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101062941","display_name":"Youhua Fu","orcid":null},"institutions":[{"id":"https://openalex.org/I41198531","display_name":"Nanjing University of Posts and Telecommunications","ror":"https://ror.org/043bpky34","country_code":"CN","type":"education","lineage":["https://openalex.org/I41198531"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Youhua Fu","raw_affiliation_strings":["College of Electronic and Optical Engineering and College of Microelectronics, Nanjing University of Posts and Telecommunications, Nanjing, China"],"affiliations":[{"raw_affiliation_string":"College of Electronic and Optical Engineering and College of Microelectronics, Nanjing University of Posts and Telecommunications, Nanjing, China","institution_ids":["https://openalex.org/I41198531"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5021356386"],"corresponding_institution_ids":["https://openalex.org/I41198531"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14921134,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"643","last_page":"648"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9995999932289124,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9991999864578247,"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9955000281333923,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.6797629594802856},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6526961922645569},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6518285274505615},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.6321530938148499},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5761693716049194},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.544074296951294},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5157063603401184},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.5106776356697083},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.46451228857040405},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.4359247386455536},{"id":"https://openalex.org/keywords/prims-algorithm","display_name":"Prim's algorithm","score":0.4334390163421631},{"id":"https://openalex.org/keywords/cluster","display_name":"Cluster (spacecraft)","score":0.4166485369205475},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3462004065513611},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26873838901519775},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13890138268470764},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.12200185656547546}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6797629594802856},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6526961922645569},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6518285274505615},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.6321530938148499},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5761693716049194},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.544074296951294},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5157063603401184},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.5106776356697083},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.46451228857040405},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.4359247386455536},{"id":"https://openalex.org/C1649724","wikidata":"https://www.wikidata.org/wiki/Q470813","display_name":"Prim's algorithm","level":4,"score":0.4334390163421631},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.4166485369205475},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3462004065513611},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26873838901519775},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13890138268470764},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.12200185656547546},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icct46805.2019.8947124","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icct46805.2019.8947124","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 19th International Conference on Communication Technology (ICCT)","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":13,"referenced_works":["https://openalex.org/W1594411984","https://openalex.org/W1979408141","https://openalex.org/W2115508454","https://openalex.org/W2124084782","https://openalex.org/W2134597454","https://openalex.org/W2162370583","https://openalex.org/W2286099942","https://openalex.org/W2396013649","https://openalex.org/W2616549282","https://openalex.org/W2740160849","https://openalex.org/W2744038534","https://openalex.org/W2775610327","https://openalex.org/W3105884155"],"related_works":["https://openalex.org/W2387385213","https://openalex.org/W4380840098","https://openalex.org/W2074214908","https://openalex.org/W4242086819","https://openalex.org/W2899787781","https://openalex.org/W2130375301","https://openalex.org/W2381121915","https://openalex.org/W2418231958","https://openalex.org/W2390742649","https://openalex.org/W2942013815"],"abstract_inverted_index":{"Clustered":[0],"interference":[1],"alignment":[2],"(IA)":[3],"can":[4,66],"reasonably":[5],"divide":[6],"the":[7,36,41,44,56,68,96,104],"sets,":[8],"where":[9],"IA":[10,28,83],"is":[11,52],"applied":[12],"in":[13,77,91],"each":[14,92],"cluster":[15,93],"independently.":[16],"This":[17],"paper":[18],"mainly":[19],"pays":[20],"attention":[21],"to":[22,54,94,102],"graph":[23,50],"clustering":[24,42],"algorithm":[25,46,74,90],"and":[26,43,62,100],"research":[27],"algorithm.":[29],"We":[30],"treat":[31],"weight":[32],"matrix":[33],"which":[34,47],"reduces":[35],"amount":[37],"of":[38,79,89,98],"data":[39],"before":[40],"Prim's":[45],"comes":[48],"from":[49],"theory":[51],"introduced":[53],"produce":[55],"maximum":[57],"spanning":[58],"tree.":[59],"Through":[60],"sorting":[61],"branches":[63],"interrupted,":[64],"we":[65,85],"obtain":[67],"combination":[69],"result.":[70],"The":[71],"proposed":[72],"clustered":[73],"has":[75],"advantages":[76],"terms":[78],"time":[80],"complexity.":[81],"In":[82],"section,":[84],"apply":[86],"two":[87],"kinds":[88],"design":[95],"code":[97],"transmitter":[99],"receiver":[101],"study":[103],"system":[105],"throughout":[106],"performance.":[107]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}