Results 281 to 290 of about 35,638 (292)
Some of the next articles are maybe not open access.
2010
Many difficult optimization problems on graphs become tractable when restricted to some classes of graphs, usually to hereditary classes. A large part of these problems can be expressed in the vertex partitioning formalism, i.e., by partitioning of the vertex set of a given graph into subsets \({V }_{1},\ldots,\!{V }_{k}\) called colour classes ...
openaire +1 more source
Many difficult optimization problems on graphs become tractable when restricted to some classes of graphs, usually to hereditary classes. A large part of these problems can be expressed in the vertex partitioning formalism, i.e., by partitioning of the vertex set of a given graph into subsets \({V }_{1},\ldots,\!{V }_{k}\) called colour classes ...
openaire +1 more source