Displaying similar documents to “Cubical approximation and computation of homology”

How to draw tropical planes.

Herrmann, Sven, Jensen, Anders, Joswig, Michael, Sturmfels, Bernd (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Programming and Testing a Two-Tree Algorithm

Vassilev, Tzvetalin, Ammerlaan, Joanna (2013)

Serdica Journal of Computing

Similarity:

ACM Computing Classification System (1998): G.2.2, F.2.2. Recently, Markov, Vassilev and Manev [2] proposed an algorithm for finding the longest path in 2-trees. In this paper, we describe an implementation of the algorithm. We briefly discuss the algorithm and present example that helps the reader grasp the main algorithmic ideas. Further, we discuss the important stages in the implementation of the algorithm and justify the decisions taken. Then, we present experimental...

An efficient connected dominating set algorithm in wsns based on the induced tree of the crossed cube

Jing Zhang, Li Xu, Shu-ming Zhou, Wei Wu, Xiucai Ye (2015)

International Journal of Applied Mathematics and Computer Science

Similarity:

The connected dominating set (CDS) has become a well-known approach for constructing a virtual backbone in wireless sensor networks. Then traffic can forwarded by the virtual backbone and other nodes turn off their radios to save energy. Furthermore, a smaller CDS incurs fewer interference problems. However, constructing a minimum CDS is an NP-hard problem, and thus most researchers concentrate on how to derive approximate algorithms. In this paper, a novel algorithm based on the induced...

Parallel computation on 2-3-trees

W. Paul, U. Vishkin, H. Wagener (1983)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity: