1097 search results - page 169 / 220 » Testing Graph Isomorphism |
GD
2007
Springer
15 years 6 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...
102
click to vote
ASPDAC
2004
ACM
15 years 6 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...
121
click to vote
ECAI
2006
Springer
15 years 6 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...
128
click to vote
FORMATS
2006
Springer
15 years 6 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 ...
110
Voted
ILP
2000
Springer
15 years 6 months ago
2000
Springer
Induction of recursive theories in the normal ILP setting is a complex task because of the non-monotonicity of the consistency property. In this paper we propose computational solu...