scientific article; zbMATH DE number 1262785

zbMath0918.68081MaRDI QIDQ4232775

C. Pandu Rangan, C. K. Wong, Venkatesan Guruswami, Maw-Shang Chang, Gerard Jennhwa Chang

Publication date: 17 August 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

vertex-disjoint triangles

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (10)

Improved Approximation Algorithms for Weighted 2-Path Partitions ⋮ On the complexity of colouring antiprismatic graphs ⋮ An improved kernel for planar vertex-disjoint triangle packing ⋮ Improved approximation algorithms for weighted 2-path partitions ⋮ Triangle strings: structures for augmentation of vertex-disjoint triangle sets ⋮ A randomized approximation algorithm for metric triangle packing ⋮ On approximating four covering and packing problems ⋮ Treelike comparability graphs ⋮ Triangle packing in (sparse) tournaments: approximation and kernelization ⋮ 1-Triangle graphs and perfect neighborhood sets

This page was built for publication: