A linear algorithm for the cutting center of a tree (Q578919)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:578919 |
scientific article; zbMATH DE number 4014045
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear algorithm for the cutting center of a tree |
scientific article; zbMATH DE number 4014045 |
Statements
A linear algorithm for the cutting center of a tree (English)
0 references
1986
0 references
As a measure of the extent to which the removal of a node disconnects a graph, the cutting number c(v) of a node v in a connected graph G has been defined to be the number of pairs of nodes in different components of G-\(\{\) \(v\}\). We present a linear algorithm for determining c(v) for all nodes of a tree, and hence for identifying the cutting center, which consists of the nodes v at which c(v) is maximized.
0 references
cutting number
0 references
connected graph
0 references
linear algorithm
0 references
0.8228372931480408
0 references
0.7894669771194458
0 references
0.7381396889686584
0 references
