𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An optimization problem on graphs

✍ Scribed by Ding-Zhu Du

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
151 KB
Volume
14
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An optimal problem in graph theory
An optimal problem in graph theory
✍ M. A. Dukhovnyi πŸ“‚ Article πŸ“… 1971 πŸ› SP MAIK Nauka/Interperiodica 🌐 English βš– 207 KB
Optimal path cover problem on block grap
Optimal path cover problem on block graphs
✍ Wong Pak-Ken πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 427 KB

Let G = (V,E) be a block graph. First we show that an algorithm for finding the path partition number p(G) by J.H. Yan and G.J. Chang gives wrong answers to some block graphs. Then we present an efficient algorithm for finding a minimum path partition of G (not just the path partition number p(G)).