The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract)

DOI10.1007/978-3-642-34611-8_9zbMath1341.05187OpenAlexW77483341MaRDI QIDQ5200494

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

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

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

This page was built for publication: The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract)