A polynomial time algorithm for the triangle packing problem on interval graphs (Q6140241): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The \(K_r\)-packing problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Computational Complexity of Combinatorial Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Packing triangles in low degree graphs and indifference graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the clique partitioning problem in weighted interval graphs / rank | |||
Normal rank | |||
Latest revision as of 08:35, 22 August 2024
scientific article; zbMATH DE number 7781992
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial time algorithm for the triangle packing problem on interval graphs |
scientific article; zbMATH DE number 7781992 |
Statements
A polynomial time algorithm for the triangle packing problem on interval graphs (English)
0 references
2 January 2024
0 references
packing triangles
0 references
polynomial time algorithm
0 references
interval graph
0 references
