A polynomial time algorithm for the triangle packing problem on interval graphs

The triangle packing problem (TPP) is to find the maximum number of pairwise vertex disjoint triangles in a given graph. The TPP is NP-complete in a general graph and even so when a given graph is restricted to a chordal graph. On the other hand, the TPP can be solved in polynomial time for unit int...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete Applied Mathematics Ročník 343; s. 180 - 183
Hlavný autor:	Myung, Young-Soo
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 30.01.2024
Predmet:	Interval graph Packing triangles Polynomial time algorithm Interval graph Packing triangles Polynomial time algorithm
ISSN:	0166-218X
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!