3122 search results - page 22 / 625 » A Theory of Network Equivalence |
ENTCS
2007
14 years 9 months ago
2007
In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to...
SIGECOM
2003
ACM
15 years 2 months ago
2003
ACM
We examine correlated equilibria in the recently introduced formalism of graphical games, a succinct representation for multiplayer games. We establish a natural and powerful rela...
84
Voted
MOBIHOC
2002
ACM
15 years 9 months ago
2002
ACM
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k?connectivity. Both topology attributes depend on the spat...
JCT
1998
14 years 9 months ago
1998
If t is a positive integer, then a partition of a non-negative integer n is a t−core if none of the hook numbers of the associated Ferrers-Young diagram is a multiple of t. These...
103
click to vote
TVLSI
2008
14 years 9 months ago
2008
Exact approaches to combinational equivalence checking, such as automatic test pattern generation-based, binary decision diagrams (BDD)-based, satisfiability-based, and hybrid appr...