{"id":"https://openalex.org/W2995240898","doi":"https://doi.org/10.1145/3368926.3369674","title":"Minimum Graph Partition with Basis","display_name":"Minimum Graph Partition with Basis","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2995240898","doi":"https://doi.org/10.1145/3368926.3369674","mag":"2995240898"},"language":"en","primary_location":{"id":"doi:10.1145/3368926.3369674","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3368926.3369674","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Tenth International Symposium on Information and Communication Technology  - SoICT 2019","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/A5102830539","display_name":"B. Minh","orcid":"https://orcid.org/0000-0002-3001-7538"},"institutions":[{"id":"https://openalex.org/I70931966","display_name":"Universit\u00e9 de Montr\u00e9al","ror":"https://ror.org/0161xgx34","country_code":"CA","type":"education","lineage":["https://openalex.org/I70931966"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"B\u00f9i Quang Minh","raw_affiliation_strings":["Universit\u00e9 de Montr\u00e9al, Department of Computer Science and Operations Research, Montr\u00e9al, QC, Canada"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Montr\u00e9al, Department of Computer Science and Operations Research, Montr\u00e9al, QC, Canada","institution_ids":["https://openalex.org/I70931966"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083251419","display_name":"Michel Toulouse","orcid":"https://orcid.org/0000-0003-0789-7829"},"institutions":[{"id":"https://openalex.org/I8775707","display_name":"Vietnamese-German University","ror":"https://ror.org/01jxtqc31","country_code":"VN","type":"education","lineage":["https://openalex.org/I8775707"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Michel Toulouse","raw_affiliation_strings":["Vietnamese-German University, Department of Computer Science, Binh Duong New City, Vietnam"],"affiliations":[{"raw_affiliation_string":"Vietnamese-German University, Department of Computer Science, Binh Duong New City, Vietnam","institution_ids":["https://openalex.org/I8775707"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5102830539"],"corresponding_institution_ids":["https://openalex.org/I70931966"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.19460864,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"178","last_page":"185"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10080","display_name":"Energy Efficient Wireless Sensor Networks","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/T10080","display_name":"Energy Efficient Wireless Sensor Networks","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.9994999766349792,"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/T11392","display_name":"Energy Harvesting in Wireless Networks","score":0.9980000257492065,"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/partition","display_name":"Partition (number theory)","score":0.7233867645263672},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.7166622877120972},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5963079929351807},{"id":"https://openalex.org/keywords/basis","display_name":"Basis (linear algebra)","score":0.5675569772720337},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5375717282295227},{"id":"https://openalex.org/keywords/partition-problem","display_name":"Partition problem","score":0.4757423400878906},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4233423173427582},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3866826891899109},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35467052459716797},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.312602162361145},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2983929514884949},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1742343008518219},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13450834155082703}],"concepts":[{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.7233867645263672},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.7166622877120972},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5963079929351807},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.5675569772720337},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5375717282295227},{"id":"https://openalex.org/C35995877","wikidata":"https://www.wikidata.org/wiki/Q1065968","display_name":"Partition problem","level":3,"score":0.4757423400878906},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4233423173427582},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3866826891899109},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35467052459716797},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.312602162361145},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2983929514884949},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1742343008518219},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13450834155082703},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3368926.3369674","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3368926.3369674","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Tenth International Symposium on Information and Communication Technology  - SoICT 2019","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":15,"referenced_works":["https://openalex.org/W1864806140","https://openalex.org/W1968143987","https://openalex.org/W1996280997","https://openalex.org/W2005606079","https://openalex.org/W2056318760","https://openalex.org/W2098863504","https://openalex.org/W2125434681","https://openalex.org/W2147540630","https://openalex.org/W2149454052","https://openalex.org/W2151685478","https://openalex.org/W2154834860","https://openalex.org/W2505968561","https://openalex.org/W2794604796","https://openalex.org/W2913196416","https://openalex.org/W4244375620"],"related_works":["https://openalex.org/W1549987457","https://openalex.org/W2025912669","https://openalex.org/W2014615094","https://openalex.org/W1977789739","https://openalex.org/W2351778335","https://openalex.org/W4240458717","https://openalex.org/W2497180562","https://openalex.org/W2379495598","https://openalex.org/W2047470742","https://openalex.org/W2767131998"],"abstract_inverted_index":{"In":[0],"this":[1,56],"paper,":[2],"we":[3],"introduce":[4],"the":[5,21,33,41,44,69,72,83],"minimum":[6],"graph":[7,13],"partition":[8,14,19],"problem":[9,89],"with":[10,15,59,91],"basis.":[11],"A":[12],"basis":[16,34],"is":[17,38],"a":[18,60],"of":[20,32,43,71],"node":[22],"set":[23],"into":[24],"connected":[25],"parts,":[26],"each":[27],"contains":[28],"exactly":[29],"one":[30],"element":[31],"set.":[35],"The":[36],"objective":[37],"to":[39,54,67,93],"minimize":[40],"size":[42],"largest":[45],"part.":[46],"We":[47],"propose":[48],"three":[49],"different":[50],"mixed-integer":[51],"linear":[52],"models":[53,73],"solve":[55,87],"problem,":[57],"enhanced":[58],"heuristic":[61],"procedure.":[62],"Experimental":[63],"tests":[64,79],"are":[65],"conducted":[66],"explore":[68],"efficiency":[70],"on":[74],"wireless":[75],"sensor":[76],"networks.":[77],"These":[78],"also":[80],"show":[81],"that":[82],"best":[84],"model":[85],"could":[86],"some":[88],"instances":[90],"up":[92],"400":[94],"nodes":[95],"in":[96],"30":[97],"minutes.":[98]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}