Small Vertex Cover Makes Petri Net Coverability and Boundedness Easier

M. Praveen. Small Vertex Cover Makes Petri Net Coverability and Boundedness Easier. In Venkatesh Raman, Saket Saurabh, editors, Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings. Volume 6478 of Lecture Notes in Computer Science, pages 216-227, Springer, 2010. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.