{"id":"https://openalex.org/W3199757527","doi":"https://doi.org/10.1109/mmar49549.2021.9528478","title":"Aggregation Algorithms for Graph Coloring","display_name":"Aggregation Algorithms for Graph Coloring","publication_year":2021,"publication_date":"2021-08-23","ids":{"openalex":"https://openalex.org/W3199757527","doi":"https://doi.org/10.1109/mmar49549.2021.9528478","mag":"3199757527"},"language":"en","primary_location":{"id":"doi:10.1109/mmar49549.2021.9528478","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mmar49549.2021.9528478","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 25th International Conference on Methods and Models in Automation and Robotics (MMAR)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5015639192","display_name":"Krzysztof Pie\u0144kosz","orcid":"https://orcid.org/0000-0001-9437-7594"},"institutions":[{"id":"https://openalex.org/I108403487","display_name":"Warsaw University of Technology","ror":"https://ror.org/00y0xnp53","country_code":"PL","type":"education","lineage":["https://openalex.org/I108403487"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Krzysztof Pienkosz","raw_affiliation_strings":["Warsaw University of Technology, Institute of Control and Computation Engineering, Warsaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Warsaw University of Technology, Institute of Control and Computation Engineering, Warsaw, Poland","institution_ids":["https://openalex.org/I108403487"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5015639192"],"corresponding_institution_ids":["https://openalex.org/I108403487"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"281","last_page":"284"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9904999732971191,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9819999933242798,"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/graph-coloring","display_name":"Graph coloring","score":0.7815390825271606},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6516391634941101},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6390044689178467},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49613603949546814},{"id":"https://openalex.org/keywords/greedy-coloring","display_name":"Greedy coloring","score":0.4751020669937134},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.46690091490745544},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.449280321598053},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4468367099761963},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.42285674810409546},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3999015688896179},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26495039463043213},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.25899988412857056},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.2436681091785431},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.14834201335906982}],"concepts":[{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.7815390825271606},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6516391634941101},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6390044689178467},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49613603949546814},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.4751020669937134},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.46690091490745544},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.449280321598053},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4468367099761963},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.42285674810409546},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3999015688896179},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26495039463043213},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.25899988412857056},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.2436681091785431},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.14834201335906982},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/mmar49549.2021.9528478","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mmar49549.2021.9528478","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 25th International Conference on Methods and Models in Automation and Robotics (MMAR)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W149461665","https://openalex.org/W1993839538","https://openalex.org/W1995231650","https://openalex.org/W2008645394","https://openalex.org/W2049930910","https://openalex.org/W2093938881","https://openalex.org/W2108301529","https://openalex.org/W2117942072","https://openalex.org/W2167036627","https://openalex.org/W2324827308"],"related_works":["https://openalex.org/W2003384085","https://openalex.org/W183100298","https://openalex.org/W4291316360","https://openalex.org/W1542397451","https://openalex.org/W1170108254","https://openalex.org/W4390280037","https://openalex.org/W2793500002","https://openalex.org/W4298054421","https://openalex.org/W1965626709","https://openalex.org/W2780971292"],"abstract_inverted_index":{"Many":[0],"practical":[1],"applications":[2],"in":[3,9,70,84,112],"production":[4],"systems":[5],"can":[6],"be":[7],"formulated":[8],"terms":[10],"of":[11,28,40,42,61,80,88,96],"graph":[12,32],"coloring,":[13],"for":[14,31],"example":[15],"task":[16],"scheduling":[17],"or":[18],"planning":[19],"a":[20,26,78],"robot":[21],"moves.":[22],"In":[23,65,91],"the":[24,38,59,71,85,89,92,97,118],"paper":[25,93],"class":[27,60],"heuristic":[29],"algorithms":[30],"coloring":[33,114],"is":[34,45,74],"considered":[35],"which":[36],"use":[37],"technique":[39],"aggregation":[41,63,98],"vertices.":[43],"It":[44],"shown":[46],"that":[47,73,110],"some":[48,104],"well":[49],"known":[50],"constructive":[51],"heuristics":[52],"like":[53],"GIS":[54],"and":[55,103],"RLF":[56,116],"belong":[57],"to":[58,76,82],"vertex":[62],"algorithms.":[64],"fact,":[66],"they":[67],"only":[68],"differ":[69],"rule":[72],"used":[75],"select":[77],"pair":[79],"vertices":[81],"aggregate":[83],"successive":[86],"steps":[87],"algorithm.":[90],"various":[94],"variants":[95],"algorithm":[99],"have":[100,107],"been":[101,108],"examined":[102],"new":[105],"rules":[106],"developed":[109],"result":[111],"better":[113],"than":[115],"with":[117],"same":[119],"computational":[120],"complexity.":[121]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}