Polynomial-time algorithms for path movement problems on trees and unicyclic graphs
© 2019 Taiwan Academic Network Management Committee. All rights reserved. In the path movement problem, we are given an undirected graph G = (V, E), a source vertex s, a destination vertex t, and a set of movable objects, called pebbles, which are placed on a subset of the vertices of a graph. We wa...
Saved in:
Main Authors: | , |
---|---|
格式: | 雜誌 |
出版: |
2020
|
主題: | |
在線閱讀: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85077215631&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/67743 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Chiang Mai University |