5606 search results - page 325 / 1122 » Randomization Techniques for Graphs. |
163
click to vote
ETS
2011
IEEE
14 years 6 months ago
2011
IEEE
—In-field diagnosability of electronic components in larger systems such as automobiles becomes a necessity for both customers and system integrators. Traditionally, functional ...
170
click to vote
ISSAC
2007
Springer
16 years 22 days ago
2007
Springer
It is only in the last five years that researchers have begun to use disk-based search techniques on a large scale. The primary examples of its use come from symbolic algebra and...
158
click to vote
WEBI
2001
Springer
15 years 11 months ago
2001
Springer
The pages and hyperlinks of the World Wide Web may be viewed as nodes and edges in a directed graph. In this paper, we propose a new definition of the distance between two pages, ...
171
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
Consider the following problem: For given graphs G and F1, . . . , Fk, find a coloring of the edges of G with k colors such that G does not contain Fi in color i. For example, if e...
169
click to vote
RSA
2002
15 years 6 months ago
2002
: Suppose that independent U 0 1 weights are assigned to the d 2 n2 edges of the complete d-partite graph with n vertices in each of the d = maximal independent sets. Then the expe...