On the Computational Complexity of Vertex Integrity and Component Order Connectivity - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Pål Grønås Drange, Markus Sortland Dregi, Pim van 't Hof. On the Computational Complexity of Vertex Integrity and Component Order Connectivity. In Hee-Kap Ahn, Chan-Su Shin, editors, Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings. Volume 8889 of Lecture Notes in Computer Science, pages 285-297, Springer, 2014. [doi]

The following publications are possibly variants of this publication:

On the Computational Complexity of Vertex Integrity and Component Order ConnectivityPål Grønås Drange, Markus S. Dregi, Pim van 't Hof. algorithmica, 76(4):1181-1202, 2016. [doi]

runs on WebDSL