Search Results - some ((drop algorithm) OR (graph algorithm))
Search alternatives:
-
1
Analysis and modeling of database storage optimization power consumption usage for green data centers
Published 2014“…This technique requires proxy candidate in order to drop some attribute for decrease the space storage. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
2
Graph coloring program of exam scheduling modeling based on bitwise coloring algorithm using python
Published 2022“…The researchers develop a graph coloring algorithm by considering some of the graph vertices to be binary numbers. …”
Get full text
Get full text
Get full text
Article -
3
Evaluating Layout and Clustering Algorithms for Visualizing Named Entity Graph
Published 2017“…Myriad of layout and clustering algorithms exist to generate visual graphs of named entities. …”
Get full text
Get full text
Get full text
Article -
4
Frequent itemset mining using graph theory / Mohammad Arsyad Mohd Yakop
Published 2017“…The Directed Acyclic Graph in High Dimensional Dataset Mining (DAGHDDM) is a graph-based mining algorithm that represents itemsets in complete graph before FIM takes place. …”
Get full text
Get full text
Thesis -
5
On some packing and partition problems in geometric graphs
Published 2018Get full text
Get full text
Thesis -
6
A O(|E|) Time Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs
Published 2010“…The algorithm completes its execution in O(|E|) for all graphs except few in which longer path (in terms of number of edges) from source to some node makes it best selection for that node.…”
Get full text
Get full text
Article -
7
Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences
Published 2024journal::journal article -
8
Optimizing boarding school schedule using graph colouring : case study of Sekolah Menengah Sultan Abdul Halim / Nur Farhana Mohd Asri
Published 2021“…The result has shown that the Greedy Algorithm has succeeded to produce the lowest minimal color compared to Graph Coloring Algorithm. …”
Get full text
Get full text
Student Project -
9
Optimizing boarding school schedule using graph coloring: case study of Sekolah Menengah Sultan Abdul Halim / Nur Farhana Mohd Asri
Published 2022“…The result has shown that the Greedy Algorithm has succeeded to produce the lowest minimal color compared to Graph Coloring Algorithm. …”
Get full text
Get full text
Research Reports -
10
Max degree around (MDA) algorithm: a smart and efficient approximate algorithm for Vertex cover and independent set problems
Published 2016“…In this paper, we have introduced small benchmark instances and some state of the art algorithms (MDG, VSA, and MVSA) have been tested along with the proposed algorithm. …”
Get full text
Get full text
Get full text
Article -
11
Solving university examination timetabling problem using intelligent water drops algorithm
Published 2024Conference Paper -
12
A Hybrid ACO-Graph Entropy for Functional Modules Detection From Protein-Protein Interaction Network
Published 2018“…Recent high-throughput experiments have generated protein-protein interaction data on a genomic scale, yielding the complete protein-protein interaction network for several organisms. Various graph clustering algorithms have been applied to protein interaction networks for detecting protein functional modules. …”
Get full text
Get full text
Get full text
Article -
13
Approximate methods for minimum vertex cover fail to provide optimal results on small graph instances: A review
Published 2018“…The small benchmark graphs will help the researchers to evaluate efficient approximation algorithms. …”
Get full text
Get full text
Get full text
Get full text
Article -
14
A quantum algorithm for minimal spanning tree
Published 2008“…Classical algorithms involve searching over some space for finding the minimal spanning tree problem in a graph. …”
Get full text
Get full text
Conference or Workshop Item -
15
A hybrid algorithm for finding shortest path in network routing.
Published 2009“…This wave gives an O( N ) steps quantum algorithm for identifying that record, where was used classical Dijkstra’s algorithm for finding shortest path problem in the graph of network and implement quantum search. …”
Get full text
Article -
16
Signless laplacian energy of interval-valued fuzzy graph and its applications
Published 2023“…In addition, the lower bound of the signless Laplacian energy in this graph is highlighted. Finally, these tools are employed to build an algorithm that helps in solving some real live problems.…”
Get full text
Get full text
Get full text
Article -
17
Solving University Examination Timetabling Problem Using Intelligent Water Drops Algorithm
Published 2024“…This research article aims at proposing Intelligent Water Drops (IWD) algorithm to solve the university examination timetabling problems (UETP). …”
Proceedings Paper -
18
Signless Laplacian energy of interval-valued fuzzy graph and its applications
Published 2023“…In addition, the lower bound of the signless Laplacian energy in this graph is highlighted. Finally, these tools are employed to build an algorithm that helps in solving some real live problems.…”
Get full text
Get full text
Article -
19
Spanning Tree Transformation of Connected Graph into Single-Row Network
Published 2010“…A spanning tree of a connected graph is a tree which consists the set of vertices and some or perhaps all of the edges from the connected graph. …”
Get full text
Get full text
Conference or Workshop Item -
20