The graph relabeling problem and its variants

• المؤلفون الرئيسيون: Geir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra
• التنسيق: وقائع المؤتمر
• منشور في: 2018
• الموضوعات: Computer Science; Engineering
• الوصول للمادة أونلاين: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=52949107176&origin=inward; http://cmuir.cmu.ac.th/jspui/handle/6653943832/60295

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 labelin...