Research ArticleOpen accessIn the keywordsComparison between Vertex Merge Algorithm and Dsatur AlgorithmHandrizal, A. Noraziah, Ahmed N. AbdallaProblem statement: In this study, the channel allocation problem in direct sequence spread spectrum was investigated. First, Coloring in channel allocation has been discussed in detail. Second; a new graph model is proposed that namely Vertex Merge Algorithm (VMA). Approach: VMA try to solve channel allocation based on graph theory. Results: The problem is to assign channel to Access Point … …Journal of Computer Science, Vol. 7, Issue 5 · 7 May 2011 · 7,254 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn Empirical Criterion for Transitive ClosureMarius OrlowskiThe paper establishes a simple and computationally economical criterion for determining whether a given adjacency matrix represents a transitive closure or not. The criterion is based on a new iterative method for finding the transitive closure adjacency matrix. This method is equivalent to but computationally more efficient than the traditional Boolean sum of successive powers of the original adjacency matrix … …Journal of Computer Science, Vol. 18, Issue 12 · 23 Dec 2022 · 5,418 accessesView PDFCite
Research ArticleOpen accessIn the abstractEnhancement of Search Results Using Dynamic Document Seed Reranking AlgorithmAngelina Geetha, A. KannanWe proposed an algorithm to improve the precision of top retrieved documents by re-ordering the retrieved documents in the initial retrieval. To re-order the documents, we first automatically extract key terms and key phrases from top N retrieved documents and generate a document index for each document. Using the standard similarity metrics, a document similarity matrix is generated for these … …Journal of Computer Science, Vol. 3, Issue 6 · 30 Jun 2007 · 6,745 accessesView PDFCite
Research ArticleOpen accessIn the abstractFolding of Trefoil Knot and its GraphM. El-Ghoul, A. I. Elrokh, M. M.A. ShamiriIn this study, we introduce the effect of the folding, conditional folding, retraction and conditional retraction on trefoil knot and its graph. We introduce the sheeted trefoil knot and the folding and retraction of this type and present the limit of foldings. We study how to obtain the types of link graph by adjacency matrix for any number of vertices … …Journal of Mathematics and Statistics, Vol. 2, Issue 2 · 30 Jun 2006 · 7,150 accessesView PDFCite