1952 search results - page 216 / 391 » Complete partitions of graphs |
173
click to vote
DMGT
2011
14 years 10 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...
163
click to vote
ACSAC
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—By accurately measuring risk for enterprise networks, attack graphs allow network defenders to understand the most critical threats and select the most effective counter...
185
click to vote
SIBGRAPI
2008
IEEE
16 years 28 days ago
2008
IEEE
2D electrophoresis is a well known method for protein separation which is extremely useful in the field of proteomics. Each spot in the image represents a protein accumulation an...
153
click to vote
ICDM
2006
IEEE
16 years 18 days ago
2006
IEEE
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
187
click to vote
CPC
2007
15 years 6 months ago
2007
Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...