1986 search results - page 287 / 398 » Path Separability of Graphs |
106
click to vote
ISMIS
2003
Springer
15 years 7 months ago
2003
Springer
We discuss how mobile agents, moving in the Internet from node to node, can communicate with each other by forwarding messages in a robust way. As a solution, we present the genera...
114
click to vote
ISMVL
2010
IEEE
15 years 7 months ago
2010
IEEE
—Multiway Decision Graphs (MDGs) subsume Binary Decision Diagrams (BDDs) and extend them by a first-order formulae suitable for model checking of data path circuits. In this pap...
108
click to vote
GD
2009
Springer
15 years 7 months ago
2009
Springer
A graph G is a support for a hypergraph H = (V, S) if the vertices of G correspond to the vertices of H such that for each hyperedge Si ∈ S the subgraph of G induced by Si is co...
103
click to vote
JSAI
2001
Springer
15 years 7 months ago
2001
Springer
The small world topology is known widespread in biological, social and man-made systems. This paper shows that the small world structure also exists in documents, such as papers. A...
128
click to vote
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
Advances in optical technology have increased the interest for multiprocessor architectures based on lightwave networks because of the vast bandwidth available. In this paper we p...