1952 search results - page 361 / 391 » Complete partitions of graphs |
130
click to vote
TCAD
2008
15 years 4 months ago
2008
Abstract--In this paper, we propose track routing and optimization for yield (TROY), the first track router for the optimization of yield loss due to random defects. As the probabi...
177
click to vote
AI
2004
Springer
15 years 4 months ago
2004
Springer
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by addin...
124
Voted
ALGORITHMICA
2002
15 years 4 months ago
2002
We study exploration problems where a robot has to construct a complete map of an unknown environment using a path that is as short as possible. In the rst problem setting we cons...
149
click to vote
RC
2000
15 years 4 months ago
2000
Conventional plotting programs adopt techniques such as adaptive sampling to approximate, but not to guarantee, correctness and completeness in graphing functions. Moreover, implic...
135
click to vote
TCS
1998
15 years 4 months ago
1998
![Threshold Dominating Sets and an Improved Characterization of W[2]](https://sciweavers.org/files/imagecache/thumbnail/imagecache/threshold_dominating_sets_and_an_improved_characterization_of_w_2_TCS_1998.jpg "Threshold Dominating Sets and an Improved Characterization of W[2]")
The Threshold Dominating Set problem is that of determining for a graph G = (V, E) whether there is a subset V ⊆ V of size k, such that for each vertex v ∈ V there are at leas...