Pages that link to "Item:Q2350898"

The following pages link to The maximum clique problem in multiple interval graphs (Q2350898):

Displaying 18 items.

• A parllel algorithm for finding a maximum weight clique of an interval graph (Q582125) (← links)
• Clique clustering yields a PTAS for max-coloring interval graphs (Q722535) (← links)
• Two-way and multiway partitioning of a set of intervals for clique-width maximization (Q1283929) (← links)
• On the \(m\)-clique free interval subgraphs polytope: polyhedral analysis and applications (Q1631662) (← links)
• Combinatorial problems on \(H\)-graphs (Q1689915) (← links)
• Cyclic arrangements with minimum modulo \(m\) winding numbers (Q2117515) (← links)
• On edge intersection graphs of paths with 2 bends (Q2357780) (← links)
• The Clique Problem in Ray Intersection Graphs (Q2912845) (← links)
• (Q3011753) (← links)
• Clique Clustering Yields a PTAS for max-Coloring Interval Graphs (Q3012804) (← links)
• (Q3094529) (← links)
• On Edge Intersection Graphs of Paths with 2 Bends (Q3181059) (← links)
• Complexity and Polynomially Solvable Special Cases of QUBO (Q5050143) (← links)
• On \(H\)-topological intersection graphs (Q5925535) (← links)
• Temporal interval cliques and independent sets (Q6039892) (← links)
• A graph-theoretic barcode ordering model for linked-reads (Q6487642) (← links)
• Contact graphs of boxes with unidirectional contacts (Q6599818) (← links)
• Recognizing unit multiple interval graphs is hard (Q6648267) (← links)