5 results for “operations on graphs”

Set a search alert

Research ArticleOpen accessEvery word in the titleSupport Measure Admissibility Based on Operations on Instance GraphsFord Lumban GaolThe concept of support is central to data mining. While the definition of support in transaction databases is intuitive and simple, that is not the case in graph datasets and databases. Most mining algorithms require the support of a pattern to be no grater than that of its subpatterns, a property called anti-monotonicity or admissibility. This study examines the requirements … …Journal of Computer Science, Vol. 3, Issue 9 · 30 Sep 2007 · 6,825 accessesView PDF Cite

Research ArticleOpen accessIn the keywordsSome Applications of Spanning Trees in Complete and Complete Bipartite GraphsS. N. DaoudProblem statement: The number of spanning trees τ(G) in graphs (networks) is an important invariant, it is also an important measure of reliability of a network. Approach: Using linear algebra and matrix analysis techniques to evaluate the associated determinants. Results: In this study we derive simple formulas for the number of spanning trees of complete graph Kn and complete bipartite … …American Journal of Applied Sciences, Vol. 9, Issue 4 · 15 Feb 2012 · 7,263 accessesView PDF Cite

Research ArticleOpen accessIn the abstractGraph Coloring Program of Exam Scheduling Modeling Based on Bitwise Coloring Algorithm Using PythonSamsul Arifin, Indra Bayu Muktyas, Wikky Fawwaz Al Maki, Mohd Khairul Bazli Mohd AzizA graph coloring is the process of assigning labels to the vertices of a graph in such a way that no two adjacent vertices have the same color. The chromatic number of a graph G is the smallest number of colors that can be assigned to it. Graph coloring has a wide range of applications and is commonly used to … …Journal of Computer Science, Vol. 18, Issue 1 · 1 Feb 2022 · 9,702 accessesView PDF Cite

Research ArticleOpen accessIn the abstractFully Retroactive Priority Queues using Persistent Binary Search TreesJoseWagner de Andrade Junior, Rodrigo Duarte SeabraClassic dynamic data structures maintains itself subject to sequence S of operations and answer queries using the latest version of the data structure. Retroactive data structures are those which allow making a modification or a query in any version of this data structure through its timeline. These data structures are used in some geometric problems and in problems related with … …Journal of Computer Science, Vol. 16, Issue 7 · 14 Jul 2020 · 7,006 accessesView PDF Cite

Research ArticleOpen accessIn the abstractOn The Integration of Decision Diagrams in High Order Logic Based Theorem Provers: a SurveySa'ed Abed, Otmane Ait Mohamed, Ghiath Al SammaneThis survey discuss approaches that integrate Decision Diagrams inside High Order Logic based Theorem provers. The approaches can be divided in two kinds, one is based on building a translation between model checker and theorem prover, the second is based on embedding the model checker algorithms inside the theorem prover. A comparison between both is discussed in detail. The paper … …Journal of Computer Science, Vol. 3, Issue 10 · 31 Oct 2007 · 6,980 accessesView PDF Cite