𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Path-Factors in the Square of a Tree

✍ Scribed by Xiaojuan Li; Zhao Zhang

Book ID
106047720
Publisher
Springer Japan
Year
2008
Tongue
English
Weight
144 KB
Volume
24
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The optimal location of a path or tree i
The optimal location of a path or tree in a tree network
✍ Edward Minieka πŸ“‚ Article πŸ“… 1985 πŸ› John Wiley and Sons 🌐 English βš– 610 KB

This article describes methods for finding an optimal location for a path-shaped or tree-shaped facility of a specified size in a tree network. Four optimization criteria are examined: minimizing distancesum, minimizing eccentricity, maximizing distancesum, and maximizing eccentricity.

Efficient counting of square substrings
Efficient counting of square substrings in a tree
✍ Kociumaka, Tomasz; Pachocki, Jakub; Radoszewski, Jakub; Rytter, Wojciech; WaleΕ„, πŸ“‚ Article πŸ“… 2014 πŸ› Elsevier Science 🌐 English βš– 846 KB
Path coverings of the vertices of a tree
Path coverings of the vertices of a tree
✍ Peter J. Slater πŸ“‚ Article πŸ“… 1979 πŸ› Elsevier Science 🌐 English βš– 840 KB

Consider a collection of disjoint paths in graph G such that every vertex is on one of these paths. The size of the smallest such collection is denoted i(G). A procedure for forming such collections is established. Restricting attention to trees, the range of values for the sizes of the collections