Staff View
Finding the Two-Core of a Tree

## Descriptive

Language
LanguageTerm (authority = ISO 639-3:2007); (type = text)
English
Genre (authority = RULIB-FS)
Other
Genre (authority = marcgt)
technical report
PhysicalDescription
InternetMediaType
application/pdf
Extent
26 p.
Note (type = special display note)
Technical report DCS-TR-121
Name (authority = RutgersOrg-School); (type = corporate)
NamePart
School of Arts and Sciences (SAS) (New Brunswick)
Name (authority = RutgersOrg-Department); (type = corporate)
NamePart
Computer Science (New Brunswick)
TypeOfResource
Text
TitleInfo
Title
Finding the Two-Core of a Tree
Abstract (type = abstract)
The 1-core of a graph is a path minimizing the sum of the distances of all vertices of the graph from the path. A linear algorithm for finding a 1-core of a tree was presented by Morgan and Slater. The problem for general graphs is NP-Hard. A 2-core of a graph is a set of two paths minimizing the sum of the distances of all vertices of the graph from any of the two paths. We consider both cases of disjoint paths and intersecting paths for a tree. Interesting relations between 1-core and 2-core of a tree are found. These relations imply efficient algorithms for finding the 2-core. The complexity of the algorithms is O(IVI.d(T)) where d(T) is the number of edges in the diameter of the tree. These algorithms are applicable for routing highways in a system of roads. A w-point core is a path minimizing the sum of the distances of all vertices of the graph from either the vertex w or the path. A linear algorithm for finding a w-point core of a tree is presented. It is applied as a procedure for the previous algorithms.
Name (type = personal)
NamePart (type = family)
Becker
NamePart (type = given)
Ronald I.
Affiliation
University of Cape Town
Role
RoleTerm (authority = marcrt); (type = text)
author
Name (type = personal)
NamePart (type = family)
Perl
NamePart (type = given)
Yehoshua
Affiliation
Computer Science (New Brunswick)
Role
RoleTerm (authority = marcrt); (type = text)
author
OriginInfo
DateCreated (encoding = w3cdtf); (keyDate = yes); (qualifier = exact)
1982-12
RelatedItem (type = host)
TitleInfo
Title
Computer Science (New Brunswick)
Identifier (type = local)
rucore21032500001
Location
PhysicalLocation (authority = marcorg); (displayLabel = Rutgers, The State University of New Jersey)
NjNbRU
Identifier (type = doi)
doi:10.7282/T3DZ0CSB
Genre (authority = ExL-Esploro)
Technical Documentation
Back to the top

## Rights

RightsDeclaration (AUTHORITY = rightsstatements.org); (TYPE = IN COPYRIGHT); (ID = http://rightsstatements.org/vocab/InC/1.0/)
This Item is protected by copyright and/or related rights.You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use.For other uses you need to obtain permission from the rights-holder(s).
Status
Availability
Status
Open
Reason