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: | , |
|---|---|
| Format: | Journal |
| Published: |
2020
|
| Subjects: | |
| Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85077215631&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/67743 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |