On computing the connectivities of graphs and digraphs (Q3330525): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.3230140211 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2035315311 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:56, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On computing the connectivities of graphs and digraphs |
scientific article |
Statements
On computing the connectivities of graphs and digraphs (English)
0 references
1984
0 references
edge-connectivity
0 references
graph
0 references
digraph
0 references
vertex-connectivity
0 references
algorithms
0 references
