646 search results - page 13 / 130 » Generalized connected domination in graphs |
ISMVL
2010
IEEE
15 years 7 months ago
2010
IEEE
Abstract—The paper studies graded properties of MTL valued binary connectives, focusing on conjunctive connectives such as t-norms, uninorms, aggregation operators, or quasicopul...
134
click to vote
WDAG
2010
Springer
15 years 6 days ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
231
Voted
ICDE
2008
IEEE
16 years 3 months ago
2008
IEEE
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
126
click to vote
ESA
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
168
Voted
DAM
2011
14 years 8 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...