On the clique partitioning problem in weighted interval graphs

DOI10.1016/j.tcs.2008.02.016zbMath1145.68039OpenAlexW1987982449MaRDI QIDQ924162

Young-Soo Myung

Publication date: 28 May 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.02.016

zbMATH Keywords

approximation algorithminterval graphclique partitioning

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

A polynomial time algorithm for the triangle packing problem on interval graphs ⋮ On the minimum clique partitioning problem on weighted chordal graphs

Cites Work

• Some approximation algorithms for the clique partition problem in weighted interval graphs

This page was built for publication: On the clique partitioning problem in weighted interval graphs