Show simple item record

A linear algorithm for the cutting center of a tree

dc.contributor.authorHarary, Franken_US
dc.contributor.authorSlater, Peter J.en_US
dc.identifier.citationHarary, Frank, Slater, Peter J. (1986/11/24)."A linear algorithm for the cutting center of a tree." Information Processing Letters 23(5): 317-319. <>en_US
dc.description.abstractAs 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.extent154233 bytes
dc.format.extent3118 bytes
dc.titleA linear algorithm for the cutting center of a treeen_US
dc.subject.hlbsecondlevelInformation and Library Scienceen_US
dc.subject.hlbsecondlevelComputer Scienceen_US
dc.subject.hlbtoplevelSocial Sciencesen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumDepartment of Mathematics, The University of Michigan, Ann Arbor, MI 48109, U.S.A.en_US
dc.contributor.affiliationotherDepartment of Mathematics and Statistics, School of Science, The University of Alabama in Huntsville, Huntsville, AL 35899, U.S.A.en_US
dc.identifier.sourceInformation Processing Lettersen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed

Files in this item

Show simple item record

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.


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.