3204 search results - page 330 / 641 » The Alcuin Number of a Graph |
208
click to vote
CATS
2008
15 years 8 months ago
2008
The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem ...
152
click to vote
NIPS
2003
15 years 8 months ago
2003
Belief propagation on cyclic graphs is an efficient algorithm for computing approximate marginal probability distributions over single nodes and neighboring nodes in the graph. I...
168
click to vote
TIT
2008
15 years 6 months ago
2008
For a linear code , the stopping redundancy of is defined as the minimum number of check nodes in a Tanner graph T for such that the size of the smallest stopping set in T is equal...
140
click to vote
EURODAC
1994
IEEE
15 years 11 months ago
1994
IEEE
This paper introduces a new Generalized Signal Transition Graph model for specifying complex mixed asynchronous/synchronouscircuits, as found in system-level interfaces. Our goal h...
217
click to vote
ISAAC
1992
Springer
15 years 10 months ago
1992
Springer
Let G be an undirected plane graph with non-negative edge length, and let k terminal pairs lie on two specified face boundaries. This paper presents an algorithm for finding k &quo...