On the parsimonious property of connectivity problems. (English) Zbl 0800.68635
Aggarwal, Alok (ed.), Discrete algorithms. Proceedings of the 1st annual ACM-SIAM symposium, held January 22-24, 1990 in San Francisco, CA (USA). Philadelphia, PA (USA): SIAM. 388-396 (1990).
For the entire collection see [Zbl 0771.00017].
MSC:
68R10 | Graph theory (including graph drawing) in computer science |
05C05 | Trees |
05C35 | Extremal problems in graph theory |