Shortest edge-disjoint paths in graphs (Q5096182): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bfb0029011 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2096782096 / rank | |||
Normal rank | |||
Latest revision as of 10:23, 30 July 2024
scientific article; zbMATH DE number 7571954
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Shortest edge-disjoint paths in graphs |
scientific article; zbMATH DE number 7571954 |
Statements
Shortest edge-disjoint paths in graphs (English)
0 references
16 August 2022
0 references
\(n\)-geodetically edge-connected graph
0 references
