1199 search results - page 60 / 240 » Graph Theory |
118
click to vote
COCOON
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...
134
Voted
CAAN
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Random graphs with given expected degrees G(w) were introduced by Chung and Lu so as to extend the theory of classical G(n, p) random graphs to include random power law g...
147
Voted
ICCS
2007
Springer
15 years 7 months ago
2007
Springer
We define an abstract model of belief propagation on a graph based on the methodology of the revision theory of truth together with the Assertion Network Toolkit, a graphical inter...
109
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We study the properties of affine rigidity of a (hyper)graph and prove a variety of fundamental results. First, we show that affine rigidity is a generic property (i.e., only depen...
129
Voted
EUROCAST
2005
Springer
15 years 9 months ago
2005
Springer
In this paper a way to have structures with partiality in its internal structure in a categorical approach is presented and, with this, a category of partial graphs Grp is given an...