4865 search results - page 196 / 973 » The Complexity of Graph Connectivity |
126
Voted
DISOPT
2010
15 years 3 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...
112
Voted
IEICET
2006
15 years 3 months ago
2006
This paper investigates some relations among four complexities of sequence over countably infinite alphabet, and shows that two kinds of empirical entropies and the self-entropy r...
123
click to vote
APAL
2010
15 years 3 months ago
2010
It is shown that the decision problem for the temporal logic with until and since connectives over real-numbers time is PSPACE-complete. This is the most practically useful dense ...
123
Voted
ARC
2008
Springer
15 years 3 months ago
2008
Springer
: This paper discusses the interplay between networks and control systems. As we gain more understanding about the structure and dynamics of physical networks, their effects on the...
115
Voted
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 ...