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

Now showing items 1-4 of 4

    • Boxicity, Cubicity And Vertex Cover 

      Shah, Chintan D (2010-09-28)
      The boxicity of a graph G, denoted as box(G), is the minimum dimension d for which each vertex of G can be mapped to a d-dimensional axis-parallel box in Rd such that two boxes intersect if and only if the corresponding ...

    • Generalization of Hitting, Covering and Packing Problems on Intervals 

      Datta Krupa, R (2018-05-29)
      Interval graphs are well studied structures. Intervals can represent resources like jobs to be sched-uled. Finding maximum independent set in interval graphs would correspond to scheduling maximum number of non-conflicting ...

    • Intersection Graphs Of Boxes And Cubes 

      Francis, Mathew C (2011-01-25)
      A graph Gis said to be an intersection graph of sets from a family of sets if there exists a function ƒ : V(G)→ such that for u,v V(G), (u,v) E(G) ƒ (u) ƒ (v) ≠ . Interval graphs are thus the intersection graphs ...

    • On Dimensional Parameters Of Graphs And Posets 

      Adiga, Abhijin (2013-06-21)
      In this thesis we study the following dimensional parameters : boxicity, cubicity, threshold dimension and poset dimension. While the first three parameters are defined on graphs, poset dimension is defined on partially ...