{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T15:13:49Z","timestamp":1730214829350,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1109\/dsd.2003.1231932","type":"proceedings-article","created":{"date-parts":[[2004,3,22]],"date-time":"2004-03-22T09:34:28Z","timestamp":1079948068000},"page":"230-237","source":"Crossref","is-referenced-by-count":3,"title":["Fast heuristics for the edge coloring of large graphs"],"prefix":"10.1109","author":[{"given":"M.","family":"Hilgemeier","sequence":"first","affiliation":[]},{"given":"N.","family":"Drechsler","sequence":"additional","affiliation":[]},{"given":"R.","family":"Drechsler","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"240","article-title":"GAME: A software environment for using genetic algorithms in circuit design","author":"g\u00f6ckel","year":"1997","journal-title":"Applications of Computer Systems"},{"key":"ref11","article-title":"The chromatic index and the degree or a graph","volume":"13","author":"gupta","year":"1966","journal-title":"Not Amer Math Soc"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/0210055"},{"article-title":"Graph coloring instances, constraint programming","year":"2002","author":"johnson","key":"ref13"},{"key":"ref14","article-title":"Edge coloring bipartite graphs","author":"kapoor","year":"1999","journal-title":"# DIT-02–0086 Tech Rep"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/335603.335880"},{"journal-title":"The Algorithm Design Manual","year":"1993","author":"skiena","key":"ref16"},{"key":"ref17","first-page":"23","article-title":"On an estimate of the chromatic class of a p-graph","volume":"3","author":"vizing","year":"1964","journal-title":"Diskret Analiz"},{"key":"ref4","article-title":"On detailed routing for a hierarchical scalable reconfigurable array with constrained switching capability","author":"caspi","year":"1998","journal-title":"CS-270 Course Project"},{"journal-title":"Graphs and Hvpergraphs","year":"1973","author":"berge","key":"ref3"},{"journal-title":"Graph Theory Electronic Edition","year":"2000","author":"diestel","key":"ref6"},{"journal-title":"Python vs perl vs java vs c++ runtimes","year":"2002","author":"connell","key":"ref5"},{"journal-title":"Edge-colourings of graphs Research Notes in Mathematics 16","year":"1977","author":"fiorine","key":"ref8"},{"key":"ref7","first-page":"313","article-title":"'forging’ optimal solutions to the edge-coloring problem","author":"enochs","year":"2001","journal-title":"Proceedings of the Genetic and Evolutionary Computation Conference GECCO-2001"},{"journal-title":"All spec cpu2000 results published by standard performance evaluation corporation","year":"2003","key":"ref2"},{"journal-title":"Dimacs Discrete Mathematics and Theoretical Computer Science","year":"1993","key":"ref1"},{"journal-title":"C++ vs java performance","year":"1998","author":"galyon","key":"ref9"}],"event":{"name":"Proceedings. Euromicro Symposium on Digital System Design","start":{"date-parts":[[2003,9,1]]},"location":"Belek-Antalya, Turkey","end":{"date-parts":[[2003,9,6]]}},"container-title":["Euromicro Symposium on Digital System Design, 2003. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8715\/27588\/01231932.pdf?arnumber=1231932","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T20:17:19Z","timestamp":1489436239000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1231932\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/dsd.2003.1231932","relation":{},"subject":[],"published":{"date-parts":[[2003]]}}}