689 search results - page 42 / 138 » A Modal-Logic Based Graph Abstraction |
FOSSACS
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Motivated by recent work on the derivation of labelled transitions and bisimulation congruences from unlabelled reaction rules, we show how to solve this problem in the D...
GD
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. One of the most popular graph drawing methods is based on achieving graph-theoretic target distances. This method was used by Kamada and Kawai [15], who formulated it as ...
AGTIVE
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. This paper deals with knowledge-based computer aided design. A novel method giving additional support for conceptual design is presented. In this method, a designer firs...
DASFAA
2010
IEEE
13 years 8 months ago
2010
IEEE
Abstract. Discovery of evolving regions in large graphs is an important issue because it is the basis of many applications such as spam websites detection in the Web, community lif...
ECAI
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. Typical ontology matching applications, such as ontology integration, focus on the computation of correspondences holding between the nodes of two graph-like structures, ...