𝔖 Bobbio Scriptorium
✦   LIBER   ✦

[ACM Press the Second Symposium - Hanoi, Vietnam (2011.10.13-2011.10.14)] Proceedings of the Second Symposium on Information and Communication Technology - SoICT '11 - Automatic code generation from event-B models

✍ Scribed by Méry, Dominique; Singh, Neeraj Kumar


Book ID
120610833
Publisher
ACM Press
Year
2011
Weight
1017 KB
Category
Article
ISBN
1450308805

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


[ACM Press the Second Symposium - Hanoi,
✍ Iwasaki, Tatsuya; Kaneko, Keiichi 📂 Article 📅 2011 🏛 ACM Press ⚖ 587 KB

In this paper, we propose an algorithm that solves the kpariwise disjoint path problem in an n-burnt pancake graph where n ≥ 4 and k = n/2 in polynomial-order time of n. We also give a proof of its correctness as well as the estimates of time complexity O(n 3 ) and the maximum path length 2n + 9.