On the computational complexity of Vertex Integrity and Component Order Connectivity

Pål Grønås Drange, Markus Sortland Dregi, Pim van 't Hof

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

13 Citations (Scopus)
Original languageEnglish
Title of host publicationAlgorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings
EditorsHee-Kap Ahn, Chan-Su Shin
PublisherSpringer Singapore
Pages285-297
Number of pages13
ISBN (Electronic)978-3-319-13075-0
ISBN (Print)978-3-319-13074-3
DOIs
Publication statusPublished - 2014
Externally publishedYes
Event25th International Symposium on Algorithms and Computation, ISAAC 2014 - Jeonju, Korea, Republic of
Duration: 15 Dec 201417 Dec 2014
Conference number: 25

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume8889

Conference

Conference25th International Symposium on Algorithms and Computation, ISAAC 2014
Abbreviated titleISAAC 2014
CountryKorea, Republic of
CityJeonju
Period15/12/1417/12/14

Cite this

Drange, P. G., Dregi, M. S., & van 't Hof, P. (2014). On the computational complexity of Vertex Integrity and Component Order Connectivity. In H-K. Ahn, & C-S. Shin (Eds.), Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings (pp. 285-297). (Lecture Notes in Computer Science; Vol. 8889). Springer Singapore. https://doi.org/10.1007/978-3-319-13075-0_23