A linear algorithm for the cutting center of a tree
dc.contributor.author | Harary, Frank | en_US |
dc.contributor.author | Slater, Peter J. | en_US |
dc.date.accessioned | 2006-04-07T19:23:58Z | |
dc.date.available | 2006-04-07T19:23:58Z | |
dc.date.issued | 1986-11-24 | en_US |
dc.identifier.citation | Harary, Frank, Slater, Peter J. (1986/11/24)."A linear algorithm for the cutting center of a tree." Information Processing Letters 23(5): 317-319. <http://hdl.handle.net/2027.42/25975> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B6V0F-482R9JR-2H/2/ae658eee6772198c33b527be31c30ba8 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/25975 | |
dc.description.abstract | 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. | en_US |
dc.format.extent | 154233 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Elsevier | en_US |
dc.title | A linear algorithm for the cutting center of a tree | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Information and Library Science | en_US |
dc.subject.hlbsecondlevel | Computer Science | en_US |
dc.subject.hlbtoplevel | Humanities | en_US |
dc.subject.hlbtoplevel | Social Sciences | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Mathematics, The University of Michigan, Ann Arbor, MI 48109, U.S.A. | en_US |
dc.contributor.affiliationother | Department of Mathematics and Statistics, School of Science, The University of Alabama in Huntsville, Huntsville, AL 35899, U.S.A. | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/25975/1/0000041.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/0020-0190(86)90093-1 | en_US |
dc.identifier.source | Information Processing Letters | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
-
Interdisciplinary and Peer-Reviewed
-
Mathematical Geography, Institute of (IMaGe)
Publications and Scholarly Research Projects.
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.