Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/60295
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Geir Agnarsson | en_US |
dc.contributor.author | Raymond Greenlaw | en_US |
dc.contributor.author | Sanpawat Kantabutra | en_US |
dc.date.accessioned | 2018-09-10T03:40:41Z | - |
dc.date.available | 2018-09-10T03:40:41Z | - |
dc.date.issued | 2008-10-06 | en_US |
dc.identifier.other | 2-s2.0-52949107176 | en_US |
dc.identifier.other | 10.1109/ECTICON.2008.4600370 | en_US |
dc.identifier.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=52949107176&origin=inward | en_US |
dc.identifier.uri | http://cmuir.cmu.ac.th/jspui/handle/6653943832/60295 | - |
dc.description.abstract | Graph labeling is a classic problem in mathematics and computing. In this paper we study an interesting set of graph labeling problems which were first introduced by Kantabutra [12]. The general problem, here called the GRAPH RELABELING PROBLEM, is to take an undirected graph G = (V, E), two labelings l1 and l2 of G, and a label switching function f and then to determine the complexity of transforming the labeling l1 into l2 using f. We define several variants of the problem and discuss their complexity. We give tight bounds for one version of the problem on chains, and show another version is NP-complete. These problems have applications in areas such as bioinformatics, networks, and VLSI. ©2008 IEEE. | en_US |
dc.subject | Computer Science | en_US |
dc.subject | Engineering | en_US |
dc.title | The graph relabeling problem and its variants | en_US |
dc.type | Conference Proceeding | en_US |
article.title.sourcetitle | 5th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology, ECTI-CON 2008 | en_US |
article.volume | 1 | en_US |
article.stream.affiliations | George Mason University, Fairfax Campus | en_US |
article.stream.affiliations | Armstrong Atlantic State University | en_US |
article.stream.affiliations | Chiang Mai University | en_US |
Appears in Collections: | CMUL: Journal Articles |
Files in This Item:
There are no files associated with this item.
Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.