The graph relabeling problem and its variants
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...
Saved in:
Main Authors: | Agnarsson G., Greenlaw R., Kantabutra S. |
---|---|
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2014
|
Online Access: | http://www.scopus.com/inward/record.url?eid=2-s2.0-52949107176&partnerID=40&md5=6eb3285463f32b7f8578ac4937b8b2f9 http://cmuir.cmu.ac.th/handle/6653943832/5468 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Language: | English |
Similar Items
-
The graph relabeling problem and its variants
by: Geir Agnarsson, et al.
Published: (2018) -
Graph relabeling with stacked labels
by: Patthamalai P., et al.
Published: (2014) -
Graph relabeling with stacked labels
by: Pochara Patthamalai, et al.
Published: (2018) -
The complexity of the evolution of GRAPH LABELINGS
by: Agnarsson G., et al.
Published: (2014) -
On cyber attacks and the maximum-weight rooted-subtree problem
by: Agnarsson G., et al.
Published: (2017)