✦ LIBER ✦

Minimax trees, paths, and cut sets

✍ Scribed by H. W. Corley; H. Golnabi

Publisher: John Wiley and Sons
Year: 1983
Tongue: English
Weight: 128 KB
Volume: 30
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.3800300411

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimax regret path location on trees

✍ Justo Puerto; Federica Ricca; Andrea Scozzari 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 241 KB

Walks and paths in trees

✍ Béla Bollobás; Mykhaylo Tyomkyn 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 159 KB

## Abstract Recently Csikvári [Combinatorica 30(2) 2010, 125–137] proved a conjecture of Nikiforov concerning the number of closed walks on trees. Our aim is to extend this theorem to all walks. In addition, we give a simpler proof of Csikvári's result and answer one of his questions in the negativ

Cartesian products of trees and paths

✍ Bandelt, Hans-J�rgen; Burosch, Gustav; Laborde, Jean-Marie 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 581 KB

We characterize the (weak) Cartesian products of trees among median graphs by a forbidden 5-vertex convex subgraph. The number of tree factors (if finite) is half the length of a largest isometric cycle. Then a characterization of Cartesian products of n trees obtains in terms of isometric cycles an

Exact description of feasible parameter

Exact description of feasible parameter sets and minimax estimation

✍ Héléne Piet-Lahanier; Eric Walter 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 530 KB

R-Trees and Symmetric Differences of Set

R-Trees and Symmetric Differences of Sets

✍ Werner F. Terhalle 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 190 KB

The supremum of the symmetric difference x y := (x \ y) ∪ (y \ x) of subsets x, y of R satisfies the so-called four-point condition; that is, for all x, x , y, y ⊆ R, one has It follows that the set E of all subsets of R which are bounded from above forms a valuated matroid relative to the map v:

Energy of Convex Sets, Shortest Paths, a

Energy of Convex Sets, Shortest Paths, and Resistance

✍ László Lovász 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 152 KB

Let us assign independent, exponentially distributed random edge lengths to the edges of an undirected graph. Lyons, Pemantle, and Peres (1999, J. Combin. Theory Ser. A 86 (1999), 158 168) proved that the expected length of the shortest path between two given nodes is bounded from below by the resis