The complexity of the evolution of GRAPH LABELINGS
We study the GRAPH RELABELING PROBLEM-given an undirected, connected, simple graph G = (V, E), two labelings l and l′ of G, and label mutation or flip functions determine the complexity of evolving the labeling l into l′. The transformation of l into l′ can be viewed as an evolutionary process gover...
Saved in:
| Main Authors: | , , |
|---|---|
| 格式: | Conference Proceeding |
| 出版: |
2018
|
| 主題: | |
| 在線閱讀: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=57749188719&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/60265 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|