An efficient distributed algorithm for finding all hinge vertices in networks (Q5466762): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/00207160412331336008 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1988575075 / rank | |||
Normal rank | |||
Revision as of 20:27, 19 March 2024
scientific article; zbMATH DE number 2198785
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient distributed algorithm for finding all hinge vertices in networks |
scientific article; zbMATH DE number 2198785 |
Statements
An efficient distributed algorithm for finding all hinge vertices in networks (English)
0 references
25 August 2005
0 references
distributed systems
0 references
distributed algorithms
0 references
static asynchronous networks
0 references
