Keiichi Kaneko. Node-to-Set Disjoint Paths Problem in Burnt Pancake Graphs. In Walter Dosch, Roger Y. Lee, editors, Proceedings of the ACIS Fourth International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD 03), October 16-18, 2003, Lübeck, Germany. pages 285-292, ACIS, 2003.
@inproceedings{Kaneko03,
title = {Node-to-Set Disjoint Paths Problem in Burnt Pancake Graphs},
author = {Keiichi Kaneko},
year = {2003},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Kaneko03},
cites = {0},
citedby = {0},
pages = {285-292},
booktitle = {Proceedings of the ACIS Fourth International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD 03), October 16-18, 2003, Lübeck, Germany},
editor = {Walter Dosch and Roger Y. Lee},
publisher = {ACIS},
isbn = {0-9700776-7-X},
}