554 search results - page 67 / 111 » Power Domination Problem in Graphs |
UAI
2004
13 years 9 months ago
2004
Based on a recent development in the area of error control coding, we introduce the notion of convolutional factor graphs (CFGs) as a new class of probabilistic graphical models. ...
DAM
2008
13 years 7 months ago
2008
Let G = (V + s, E) be a 2-edge-connected graph with a designated vertex s. A pair of edges rs, st is called admissible if splitting off these edges (replacing rs and st by rt) pre...
ICTAI
2010
IEEE
13 years 5 months ago
2010
IEEE
The balanced graph partitioning consists in dividing the vertices of an undirected graph into a given number of subsets of approximately equal size, such that the number of edges c...
GG
2004
Springer
14 years 1 months ago
2004
Springer
Refactorings are transformations that change the structure of a program, while preserving the behavior. The topic has attracted a lot of attention recently, since it is a promising...
IJCAI
1989
13 years 9 months ago
1989
Solving design and analysis problems in physical worlds requires the representatio n of large amounts of knowledge. Recently, there has been much interest in explicitly making ass...