A polynomial time algorithm for finding the absolute center of a network (Q4000529): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.3230110404 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1980170589 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4083324 / rank | |||
Normal rank | |||
Latest revision as of 09:28, 16 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial time algorithm for finding the absolute center of a network |
scientific article |
Statements
A polynomial time algorithm for finding the absolute center of a network (English)
0 references
20 September 1992
0 references
absolute center of a network
0 references
polynomial time algorithm
0 references
