The max clique problem in classes of string-graphs
From MaRDI portal
Publication:1201270
DOI10.1016/0012-365X(92)90688-CzbMath0764.68129MaRDI QIDQ1201270
Matthias Middendorf, Frank Pfeiffer
Publication date: 17 January 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (19)
Finding a Maximum Clique in a Grounded 1-Bend String Graph ⋮ Intersection graphs of L-shapes and segments in the plane ⋮ Complexity and Polynomially Solvable Special Cases of QUBO ⋮ On approximating MIS over B1-VPG graphs* ⋮ On intersection representations of co-planar graphs ⋮ The clique problem in ray intersection graphs ⋮ Polychromatic colorings of unions of geometric hypergraphs ⋮ Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded ⋮ Visibility representations of toroidal and Klein-bottle graphs ⋮ Coloring triangle-free L-graphs with \(O (\log \log n)\) colors ⋮ Maximum independent set and maximum clique algorithms for overlap graphs ⋮ Order-Preserving 1-String Representations of Planar Graphs ⋮ An algorithm for the maximum weight independent set problem on outerstring graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On grounded \(\llcorner\)-graphs and their relatives ⋮ Maximum Independent Set in 2-Direction Outersegment Graphs ⋮ Segment representations with small resolution ⋮ The maximum clique problem in multiple interval graphs
Cites Work
This page was built for publication: The max clique problem in classes of string-graphs
