Browsing Computer Science and Automation (CSA) by Subject "Geometric Intersection Graphs"

Now showing items 1-2 of 2

    • Fast Algorithms for Max Cut on Geometric Intersection Graphs 

      Joshi, Utkarsh
      In this work, we design fast algorithms for max cut on geometric intersection graphs. In the maximum cut (a.k.a., max cut) problem, the input is an undirected graph, and the goal is to partition the vertex set into two ...

    • Maximum Independent Set of Rectangles - An Empirical Study 

      Komal, Alok Kumar
      We study the Maximum Independent Set of Rectangles (MISR) problem. The problem involves a collection of n axis-parallel rectangles in 2D with weights. For the unweighted case, the goal is to find the maximum number of ...