1461 search results - page 70 / 293 » Complexity of Graph Covering Problems |
STACS
2010
Springer
14 years 2 months ago
2010
Springer
We present a method for reducing the treewidth of a graph while preserving all the minimal s−t separators. This technique turns out to be very useful in the design of parameteriz...
DAM
2007
13 years 7 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 ...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We prove that the max-cut and max-bisection problems are NP-hard on unit disk graphs. We also show that -precision graphs are planar for > 1/ 2 and give a dichotomy theorem f...
TAGT
1998
Springer
13 years 12 months ago
1998
Springer
Abstract. Management of development processes in di erent engineering disciplines is a challenging task. We present an integrated approach which covers not only the activities to b...
FSEN
2009
Springer
14 years 2 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...