On the computational complexity of vertex integrity and component order connectivity
From MaRDI portal
Publication:727981
DOI10.1007/s00453-016-0127-xzbMath1355.68115arXiv1403.6331MaRDI QIDQ727981
Pim van 't Hof, D. Kharzeev, Pål Grønås Drange, Markus Sortland Dregi
Publication date: 21 December 2016
Published in: Algorithmica, Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.6331
68Q25: Analysis of algorithms and problem complexity
05C85: Graph algorithms (graph-theoretic aspects)
05C22: Signed and weighted graphs