Finding the path centre of a communications network

Title:

Finding the path centre of a communications network

Creator:

Dündar, Pinar, Kilic, Elgin, and Balci , Mehmet Ali

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:0cea3ab2-50bf-425a-9937-c86355114871
uuid:0cea3ab2-50bf-425a-9937-c86355114871

Subject:

Network design, network planning, operations and control, and graph theory

Type:

model:article and TEXT

Format:

bez média and svazek

Description:

The centre of a communications network is a vertex set. The distances between every vertex in the centre set and all other vertices of the network are minimal. In some cases, the centre of the network can be a path, which includes a desired number of vertices. This centre is called a path centre of the network. In this paper, we aim to find a path centre of a given network with the needed number of vertices. We give the distance measures of the network and represent an algorithm searching the path centre of the network.

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Source:

Neural network world: international journal on neural and mass-parallel computing and information systems | 2009 Volume:19 | Number:6

Harvested from:

CDK

Metadata only:

false