251 search results - page 33 / 51 » The Graphs with All Subgraphs T-Perfect |
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
DMGT
2011
12 years 11 months ago
2011
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...
RECOMB
2004
Springer
14 years 8 months ago
2004
Springer
Finding recurring residue packing patterns, or spatial motifs, that characterize protein structural families is an important problem in bioinformatics. To this end, we apply a nov...
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
The increasing availability of network data is creating a great potential for knowledge discovery from graph data. In many applications, feature vectors are given in addition to g...
ENDM
2007
13 years 7 months ago
2007
Given a graph G = (V, E), let P be a partition of V . We say that P is dominating if, for each part P of P, the set V \ P is a dominating set in G (equivalently, if every vertex h...