2531 search results - page 332 / 507 » Group testing in graphs |
162
click to vote
ICPP
1992
IEEE
15 years 10 months ago
1992
IEEE
-- Distributed routing algorithms presented in the literature have tended to be specific to a particular network topology. In order to test the applicability of various routing str...
150
click to vote
GD
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. A graph is planar if and only if it does not contain a Kuratowski subdivision. Hence such a subdivision can be used as a witness for non-planarity. Modern planarity testi...
146
click to vote
ASPDAC
2004
ACM
15 years 10 months ago
2004
ACM
- Minimum area is one of the important objectives in technology mapping for lookup table-based FPGAs. It has been proven that the problem is NP-complete. This paper presents a poly...
171
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
Semantic matching determines the mappings between the nodes of two graphs (e.g., ontologies) by computing logical relations (e.g., subsumption) holding among the nodes that corresp...
175
click to vote
FORMATS
2006
Springer
15 years 10 months ago
2006
Springer
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...