760 search results - page 16 / 152 » Algorithms for finding clique-transversals of graphs |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We consider the problem of finding a lowest cost dominating set in a given disk graph containing n disks. The problem has been extensively studied on subclasses of disk graphs, ye...
ICML
2003
IEEE
14 years 9 months ago
2003
IEEE
Many techniques in the social sciences and graph theory deal with the problem of examining and analyzing patterns found in the underlying structure and associations of a group of ...
WEBI
2004
Springer
14 years 2 months ago
2004
Springer
Content analysis and citation analysis are two common methods in recommending system. Compared with content analysis, citation analysis can discover more implicitly related papers...
SDM
2009
SIAM
14 years 5 months ago
2009
SIAM
Consider a 0–1 observation matrix M, where rows correspond to entities and columns correspond to signals; a value of 1 (or 0) in cell (i, j) of M indicates that signal j has bee...
SPAA
2005
ACM
14 years 2 months ago
2005
ACM
In 1995, Gremban, Miller, and Zagha introduced supporttree preconditioners and a parallel algorithm called supporttree conjugate gradient (STCG) for solving linear systems of the ...