Sciweavers

44 search results - page 5 / 9
» The distinguishing number of Cartesian products of complete ...
Sort
View
DM
1999
61views more  DM 1999»
13 years 5 months ago
On an equivalence in discrete extremal problems
We introduce some equivalence relations on graphs and posets and prove that they are closed under the cartesian product operation. These relations concern the edge-isoperimetric p...
Sergei L. Bezrukov
SIAMDM
2008
113views more  SIAMDM 2008»
13 years 5 months ago
Power Domination in Product Graphs
The power system monitoring problem asks for as few as possible measurement devices to be put in an electric power system. The problem has a graph theory model involving power dom...
Paul Dorbec, Michel Mollard, Sandi Klavzar, Simon ...
JGT
2010
158views more  JGT 2010»
13 years 4 months ago
Cubicity of interval graphs and the claw number
Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product I1 × I2 × · · · × Ib, where ea...
Abhijin Adiga, L. Sunil Chandran
ICCS
2009
Springer
14 years 9 days ago
Distinguishing Answers in Conceptual Graph Knowledge Bases
Abstract. In knowledge bases, the open world assumption and the ability to express variables may lead to an answer redundancy problem. This problem occurs when the returned answers...
Nicolas Moreau, Michel Leclère, Madalina Cr...
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
14 years 16 days ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu