Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Polynomial Time Algorithm for Min-Ranks of Graphs with Simple Tree
  Structures   The min-rank of a graph was introduced by Haemers (1978) to bound the Shannon
capacity of a graph. This parameter of a graph has recently gained much more
attention from the research community after the work of Bar-Yossef et al.
(2006). In their paper, it was shown that the min-rank of a graph G
characterizes the optimal scalar linear solution of an instance of the Index
Coding with Side Information (ICSI) problem described by the graph G. It was
shown by Peeters (1996) that computing the min-rank of a general graph is an
NP-hard problem. There are very few known families of graphs whose min-ranks
can be found in polynomial time. In this work, we introduce a new family of
graphs with efficiently computed min-ranks. Specifically, we establish a
polynomial time dynamic programming algorithm to compute the min-ranks of
graphs having simple tree structures. Intuitively, such graphs are obtained by
gluing together, in a tree-like structure, any set of graphs for which the
min-ranks can be determined in polynomial time. A polynomial time algorithm to
recognize such graphs is also proposed.

34
The categories of this paper are: chem-ph
5
The categories of this paper are: gr-qc
3
The categories of this paper are: physics
18
The categories of this paper are: econ
14
The categories of this paper are: math-ph
12
The categories of this paper are: nucl-th
26
The categories of this paper are: bayes-an
11
The categories of this paper are: hep-lat
25
The categories of this paper are: patt-sol
10
The categories of this paper are: q-bio
6
The categories of this paper are: astro-ph
15
The categories of this paper are: nucl-ex
32
The categories of this paper are: atom-ph
35
The categories of this paper are: mtrl-th
36
The categories of this paper are: cmp-lg
19
The categories of this paper are: eess