2612 search results - page 85 / 523 » Switching Graphs and Their Complexity |
115
click to vote
FSEN
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We analyze a model of fault-tolerant systems in a probabilistic setting. The model has been introduced under the name of “sabotage games”. A reachability problem over...
136
click to vote
ACMSE
2006
ACM
15 years 10 months ago
2006
ACM
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...
114
Voted
ICSE
1995
IEEE-ACM
15 years 7 months ago
1995
IEEE-ACM
Compilers and other programming environment tools derive information from the source code of programs; derived information includes compiled code, interprocedural summary informat...
128
click to vote
DISOPT
2010
15 years 4 months ago
2010
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
118
click to vote
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
We first consider infinite two-player games on pushdown graphs. In previous work, Cachat, Duparc and Thomas [4] have presented a winning decidable condition that is Σ3-complete ...