2612 search results - page 323 / 523 » Switching Graphs and Their Complexity |
168
click to vote
DAGSTUHL
1996
15 years 6 months ago
1996
An analysis method for specialization of imperative programs is described in this paper. This analysis is an inter-procedural data flow method operating on control flow graphs and...
133
click to vote
GG
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Amalgamation is a well-known concept for graph transformations in order to model synchronized parallelism of rules with shared subrules and corresponding transformations....
144
click to vote
SIGECOM
2008
ACM
15 years 4 months ago
2008
ACM
This paper studies a virus inoculation game on social networks. A framework is presented which allows the measuring of the windfall of friendship, i.e., how much players benefit i...
163
click to vote
TALG
2008
15 years 4 months ago
2008
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
133
click to vote
TCS
2008
15 years 4 months ago
2008
The replication number of a branching program is the minimum number R such that along every accepting computation at most R variables are tested more than once; the sets of variab...