2612 search results - page 247 / 523 » Switching Graphs and Their Complexity |
181
click to vote
CONCUR
2006
Springer
15 years 9 months ago
2006
Springer
Event structures have been used for giving true concurrent semantics to languages and models of concurrency such as CCS, Petri nets and graph grammars. Although certain nominal cal...
142
click to vote
IDA
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
155
click to vote
DAM
2007
15 years 5 months ago
2007
In hardware design, it is necessary to simulate the anticipated behavior of the integrated circuit before it is actually cast in silicon. As simulation procedures are long due to ...
149
click to vote
ATMOS
2010
15 years 4 months ago
2010
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
133
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...