Browsing Computer Science and Automation (CSA) by Subject "Fixed Parameter Tractable Algorithms"

Now showing items 1-2 of 2

    • Delaunay Graphs for Various Geometric Objects 

      Agrawal, Akanksha (2017-12-12)
      Given a set of n points P ⊂ R2, the Delaunay graph of P for a family of geometric objects C is a graph defined as follows: the vertex set is P and two points p, p' ∈ P are connected by an edge if and only if there exists ...

    • Parameterized Complexity of Maximum Edge Coloring in Graphs 

      Goyal, Prachi (2018-03-09)
      The classical graph edge coloring problem deals in coloring the edges of a given graph with minimum number of colors such that no two adjacent edges in the graph, get the same color in the proposed coloring. In the following ...