803 search results - page 63 / 161 » Independence in Direct-Product Graphs |
85
Voted
ISAAC
2004
Springer
15 years 6 months ago
2004
Springer
The k-Leaf Root problem is a particular case of graph power problems. Here, we study “error correction” versions of k-Leaf Root—that is, for instance, adding or deleting at m...
109
click to vote
SSPR
2004
Springer
15 years 6 months ago
2004
Springer
We present a probabilistic graphical model for point set matching. By using a result about the redundancy of the pairwise distances in a point set, we represent the binary relation...
113
Voted
SIROCCO
2001
15 years 2 months ago
2001
This paper considers the design of a survivable WDM network based on covering the initial network with sub-networks, which are protected independently from each other. We focus on...
CPC
2006
15 years 22 days ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
124
click to vote
CORR
2007
Springer
15 years 21 days ago
2007
Springer
Abstract—The problem of hypothesis testing against independence for a Gauss–Markov random field (GMRF) is analyzed. Assuming an acyclic dependency graph, an expression for the...