The absolute center of a unicyclic network (Q908837): Difference between revisions
From MaRDI portal
Added link to MaRDI 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 / cites work | |||
| Property / cites work: The absolute centre of a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A polynomial time algorithm for finding the absolute center of a network / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0166-218x(89)90009-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2022198180 / rank | |||
Normal rank | |||
Latest revision as of 08:27, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The absolute center of a unicyclic network |
scientific article |
Statements
The absolute center of a unicyclic network (English)
0 references
1989
0 references
A linear-time algorithm is presented for solving the absolute center problem on a unicyclic network.
0 references
facility location
0 references
linear-time algorithm
0 references
absolute center problem
0 references
unicyclic network
0 references
