803 search results - page 26 / 161 » Independence in Direct-Product Graphs |
73
Voted
BTW
2001
Springer
15 years 5 months ago
2001
Springer
In this article, we present our efforts1 on realizing transformation independence in open, extensible, and highly distributed multimedia information The main focus is on the abstra...
117
click to vote
SIAMDM
2010
14 years 7 months ago
2010
Let G be a graph with n vertices and independence number . Hadwiger's conjecture implies that G contains a clique minor of order at least n/. In 1982, Duchet and Meyniel prov...
128
Voted
OL
2010
14 years 7 months ago
2010
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex probl...
147
Voted
WG
2005
Springer
15 years 6 months ago
2005
Springer
In unweighted case, approximation ratio for the independent set problem has been analyzed in terms of the graph parameters, such as the number of vertices, maximum degree, and aver...
82
Voted
AAAI
2006
15 years 2 months ago
2006
We introduce CUI networks, a compact graphical representation of utility functions over multiple attributes. CUI networks model multiattribute utility functions using the well stu...