Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
Shuai Ma, Yang Cao, Wenfei Fan, Jinpeng Huai, Tian...
In this paper, a novel automatic approach for the concurrent topology and routing optimization that achieves a high quality network layout is proposed. This optimization is based ...
In this paper, we present a scalable fully distributed version of a Mobile Backbone Network Topology Synthesis Algorithm (MBN-TSA) for constructing and maintaining a dynamic backb...
E cient and powerful topologically adaptable deformable surfaces can be created by embedding and de ning discrete deformable surface models in terms of an A ne Cell Decomposition (...
The paper presents a new set of axioms of digital topology, which are easily understandable for application developers. They define a class of locally finite (LF) topological space...