Packing interval graphs with vertex-disjoint triangles
Ton Kloks
TL;DR
This paper presents a polynomial-time algorithm for packing vertex-disjoint triangles in interval graphs, addressing a specific graph packing problem with potential applications in network design and combinatorial optimization.
Contribution
The paper introduces the first polynomial algorithm for packing vertex-disjoint triangles specifically in interval graphs, a notable class of graphs.
Findings
Existence of polynomial algorithm for packing triangles in interval graphs
Efficient solution for a specific graph packing problem
Advancement in understanding triangle packings in special graph classes
Abstract
We show that there exists a polynomial algorithm to pack interval graphs with vertex-disjoint triangles.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph Labeling and Dimension Problems · Complexity and Algorithms in Graphs