𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithms for Graphic Polymatroids and Parametrics-Sets

✍ Scribed by Harold N Gabow

Book ID
102579169
Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
328 KB
Volume
26
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

✦ Synopsis

We present efficient algorithms for finding the covering number, finding a base, and finding the packing number, all in graphic polymatroids. The integral covering number is the arboricity of an undirected graph; computing it is suggested as an Ε½ open problem by Gallo et al.

πŸ“œ SIMILAR VOLUMES

Language for definition and manipulation
Language for definition and manipulation of parametric graphic representation
✍ C. Devoti; P. Galli; U. Cugini πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 112 KB

In this issue of Computer-aided Design are listed the abstracts and, where given, the authors' biographies from the programme of CAD84. The papers are arranged in the order in which they will be given. For the parallel sessions, papers presented in the Winter Garden are shown before those in the Cla