A heuristic approach for dividing graphs into bi-connected components with a size constraint (Q2403269)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A heuristic approach for dividing graphs into bi-connected components with a size constraint |
scientific article |
Statements
A heuristic approach for dividing graphs into bi-connected components with a size constraint (English)
0 references
8 September 2017
0 references
bi-connected graphs
0 references
2-connected
0 references
breadth first search
0 references
growth algorithm
0 references
graph partitioning
0 references
heuristic
0 references
0 references
0 references
0 references
0 references
