Property Testing on k-Vertex-Connectivity of Graphs
From MaRDI portal
Publication:3521945
DOI10.1007/978-3-540-70575-8_44zbMath1153.68497OpenAlexW1760544654MaRDI QIDQ3521945
Publication date: 28 August 2008
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70575-8_44
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Connectivity (05C40)
Related Items
Testing the \((s,t)\) connectivity of graphs and digraphs ⋮ Testing Eulerianity and connectivity in directed sparse graphs ⋮ Testing \(k\)-edge-connectivity of digraphs ⋮ Dynamic graph stream algorithms in \(o(n)\) space