7 results for “Complexity of graphs”

Set a search alert

Research ArticleOpen accessIn the keywordsComplexity of Cocktail Party Graph and Crown GraphS. N. DaoudProblem statement: The number of spanning trees τ(G) in graphs (networks) was an important invariant. Approach: Using the properties of the Chebyshev polynomials of the second kind and the linear algebra techniques to evaluate the associated determinants. Results: The complexity, number of spanning trees, of the cocktail party graph on 2n vertices, given in detail in the text was proved. … …American Journal of Applied Sciences, Vol. 9, Issue 2 · 12 Dec 2011 · 7,868 accessesView PDF Cite

Research ArticleOpen accessIn the abstractComplex SQL-NoSQL Query Translation for Data Lake ManagementNurhadi, Rabiah Abdul Kadir, Ely Salwana Mat SurinA data lake refers to an extremely large data resource or repository. Data lakes store large amounts of data and use advanced analytics to pair data from multiple sources with different types of structured, semi-structured, and unstructured information. NoSQL databases such as Mongodb, Redis, Neo4j, and Cassandra are nontabular and they store data differently rather than use relational tables. NoSQL … …Journal of Computer Science, Vol. 18, Issue 12 · 19 Dec 2022 · 9,277 accessesView PDF Cite

Review ArticleOpen accessIn the abstractRRDTool: A Round Robin Database for Network MonitoringManmohan Singh, Sweta Dargada, Hemant Mewada et al.RRDtool is a circular database that stores time series data. RRD tool assumes time-variable data inintervals of a certain length. An interval is named as a step, and specifiedupon creation of an RRD file which cannot be changed afterward. Because datamay not always come at just the right time, RRD tool will automaticallyinterpolate any submitted data. This is done to … …Journal of Computer Science, Vol. 18, Issue 8 · 27 Aug 2022 · 8,350 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

Research ArticleOpen accessIn the abstractLow Complexity Performance Effective Task Scheduling Algorithm for Heterogeneous Computing EnvironmentsE. Ilavarasan, P. ThambiduraiA heterogeneous computing environment is a suite of heterogeneous processors interconnected by high-speed networks, thereby promising high speed processing of computationally intensive applications with diverse computing needs. Scheduling of an application modeled by Directed Acyclic Graph (DAG) is a key issue when aiming at high performance in this kind of environment. The problem is generally addressed in terms of task … …Journal of Computer Science, Vol. 3, Issue 2 · 28 Feb 2007 · 9,663 accessesView PDF Cite

Research ArticleOpen accessAll words, across the recordModule Management Tool in Software Development OrganizationsAhmad A. Al-Rababah, Mohammad A. Al-RababahModule management is an important task at developers’ level in software development organizations. So we consider in this paper software as collection of several modules. Also we study a method of clustering of modules of a large software system. The need of doing such clustering is justified to be an important part of software management in the software development organizations. … …Journal of Computer Science, Vol. 3, Issue 5 · 31 May 2007 · 7,033 accessesView PDF Cite