A grounded 1-bend string graph is an intersection graph of a set of polygonallines, each with one bend, such that the lines lie above a common horizontal line . We show that finding a maximum clique is APX-hard, even for strictly $y$-monotone strings . We give fast algorithms to compute a maximum . clique for different subclasses of grounded segment graphs, which are formed by restricting the strings to various forms of $L$-shapes . We also give algorithms to find a maximum

Author(s) : J. Mark Keil, Debajyoti Mondal, Ehsan Moradi, Yakov Nekrich

Links : PDF - Abstract

Code :
Coursera

Keywords : maximum - bend - graph - grounded - clique -

Leave a Reply

Your email address will not be published. Required fields are marked *