𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximate equations for the determination of complexing parameters: Applicability criteria

✍ Scribed by A. V. Zubkov; T. V. Ivanova

Publisher
Springer US
Year
1982
Tongue
English
Weight
736 KB
Volume
11
Category
Article
ISSN
0095-9782

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the complexity of the approximation o
On the complexity of the approximation of nonplanarity parameters for cubic graphs
✍ Luerbio Faria; Celina M. Herrera de Figueiredo; Candido F.X. MendonΓ§a πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 496 KB

Let G = (V; E) be a simple graph. The NON-PLANAR DELETION problem consists in ΓΏnding a smallest subset E βŠ‚ E such that H =(V; E\E ) is a planar graph. The SPLITTING NUMBER problem consists in ΓΏnding the smallest integer k ΒΏ 0, such that a planar graph H can be deΓΏned from G by k vertex splitting ope