554 search results - page 67 / 111 » Power Domination Problem in Graphs |
123
Voted
UAI
2004
15 years 3 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. ...
112
click to vote
DAM
2008
15 years 2 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...
130
click to vote
ICTAI
2010
IEEE
15 years 13 days 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...
129
Voted
GG
2004
Springer
15 years 7 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...
127
click to vote
IJCAI
1989
15 years 3 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...