The maximum clique problem in multiple interval graphs (extended abstract)

DOI10.1007/978-3-642-34611-8_9MaRDI QIDQ5200494zbMATH OpenOpenAlexFDO

Authors Mathew C. Francis, Daniel Gonçalves, Pascal Ochem

Publication date 6 November 2012

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-34611-8_9

zbMATH Keywords

\(t\)-circular interval graphs\(t\)-circular track graphs

Mathematics Subject Classification ID

Distance in graphs (05C12) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• The maximum clique problem in multiple interval graphs
• Optimization problems in multiple-interval graphs
• Optimization problems in multiple-interval graphs
• On the parameterized complexity of multiple-interval graph problems
• A polynomial algorithm for the k-cluster problem on the interval graphs

Cited in

(16)

• Two-way and multiway partitioning of a set of intervals for clique-width maximization
• On the m-clique free interval subgraphs polytope: polyhedral analysis and applications
• \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates
• \(\mathcal{U}\)-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited
• On the maxima of Motzkin-Straus programs and cliques of graphs
• The maximum clique problem in multiple interval graphs
• Optimization problems in multiple-interval graphs
• Optimization problems in multiple-interval graphs
• scientific article; zbMATH DE number 5914909 (Why is no real title available?)
• Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
• scientific article; zbMATH DE number 5963787 (Why is no real title available?)
• A polynomial algorithm for the k-cluster problem on the interval graphs
• RESTRICTED TRACK ASSIGNMENT WITH APPLICATIONS
• A parllel algorithm for finding a maximum weight clique of an interval graph
• Recognizing unit multiple interval graphs is hard
• Clique clustering yields a PTAS for max-coloring interval graphs

This page was built for publication: The maximum clique problem in multiple interval graphs (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5200494)