Sciweavers

803 search results - page 26 / 161
» Independence in Direct-Product Graphs
Sort
View
BTW
2001
Springer
103views Database» more  BTW 2001»
13 years 12 months ago
On Realizing Transformation Independence in Open, Distributed Multimedia Information Systems
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...
Ulrich Marder
SIAMDM
2010
170views more  SIAMDM 2010»
13 years 2 months ago
Complete Minors and Independence Number
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...
Jacob Fox
OL
2010
140views more  OL 2010»
13 years 2 months ago
Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes
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...
Balabhaskar Balasundaram, Shyam Sundar Chandramoul...
WG
2005
Springer
14 years 26 days ago
Approximation Algorithms for the Weighted Independent Set Problem
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...
Akihisa Kako, Takao Ono, Tomio Hirata, Magnú...
AAAI
2006
13 years 8 months ago
CUI Networks: A Graphical Representation for Conditional Utility Independence
We introduce CUI networks, a compact graphical representation of utility functions over multiple attributes. CUI networks model multiattribute utility functions using the well stu...
Yagil Engel, Michael P. Wellman