Estimating all pairs shortest paths in restricted graph families: a unified approach (Q5704853): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jalgor.2004.09.002 / rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jalgor.2004.09.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2109370679 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JALGOR.2004.09.002 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 17:23, 30 December 2024
scientific article; zbMATH DE number 2229453
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Estimating all pairs shortest paths in restricted graph families: a unified approach |
scientific article; zbMATH DE number 2229453 |
Statements
Estimating all pairs shortest paths in restricted graph families: a unified approach (English)
0 references
16 November 2005
0 references
weakly chordal graphs
0 references
