Căutare după Subiect "2-vertex-connected components"
Afișează articolele 1-1 of 1
-
Counting Minimum Cost Bounded Degree Subtrees in Graphs with Small 2-Vertex-Connected Components
("Dunarea de Jos" University of Galati, 2013)In this paper we present new algorithms for counting minimum cost bounded degree subtrees in connected graphs in which the 2-vertex-connected (biconnected) components have small sizes. The 2-vertex-connected components and ...
