✦ LIBER ✦

Realization of a symmetric terminal capacity matrix by a tree with the minimum diameter

✍ Scribed by T. Ozawa

Publisher: John Wiley and Sons
Year: 1980
Tongue: English
Weight: 662 KB
Volume: 10
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230100204

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The method of minimum iterations with mi

The method of minimum iterations with minimum errors for a system of linear algebraic equations with a symmetrical matrix

✍ V.M Fridman 📂 Article 📅 1963 🏛 Elsevier Science ⚖ 107 KB

Covering the Edges of a Graph by a Presc

Covering the Edges of a Graph by a Prescribed Tree with Minimum Overlap

✍ Noga Alon; Yair Caro; Raphael Yuster 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 360 KB

Let H=(V H , E H ) be a graph, and let k be a positive integer. A graph G=(V G , E G ) is H-coverable with overlap k if there is a covering of the edges of G by copies of H such that no edge of G is covered more than k times. Denote by overlap(H, G) the minimum k for which G is H-coverable with over