2612 search results - page 195 / 523 » Switching Graphs and Their Complexity |
150
click to vote
COMPLEX
2009
Springer
15 years 8 months ago
2009
Springer
Creating ensembles of random but "realistic" topologies for complex systems is crucial for many tasks such as benchmark generation and algorithm analysis. In general, exp...
138
click to vote
WWW
2004
ACM
16 years 5 months ago
2004
ACM
While we expect to discover knowledge in the texts available on the Web, such discovery usually requires many complex analysis steps, most of which require different text handling...
135
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
135
click to vote
WG
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We study graph searching games where a number of cops try to capture a robber that is hiding in a system of tunnels modelled as a graph. While the current position of the...
137
click to vote
STACS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...