6 articles for “Bipartite Graph”

Set a search alert

Research ArticleOpen accessPhrase in the titleSome 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 keywordsGraph Folding of Some Special GraphsE. El-Kholy, A. El-EsawyIn this study we introduced the definition of graph folding then, we proved that we cannot fold any complete graph except the bipartite graph. By using incidence matrices we described the graph folding. …Journal of Mathematics and Statistics, Vol. 1, Issue 1 · 30 Mar 2010 · 7,351 accessesView PDF Cite

Research ArticleOpen accessIn the keywordsExperimental Comparison Between Evolutionary Algorithm and Barycenter Heuristic for the Bipartite Drawing ProblemZoheir EzzianeThis research investigates the use of intelligent techniques for the bipartite drawing problem (BDP). Due to the combinatorial nature of the solution space, the use of traditional search methods lead to exponential time. Hence, the aim of this paper is to speed up the search time when solving the BDP through the use of Evolutionary Algorithms (EAs) and Barycenter Heuristic … …Journal of Computer Science, Vol. 3, Issue 9 · 30 Sep 2007 · 6,716 accessesView PDF Cite

Research ArticleOpen accessIn the abstractSemSimp: A Parametric Method for Evaluating the Semantic Similarity of Digital ResourcesAntonio De Nicola, Anna Formica, Ida Mele, Francesco TaglinoAbioui, H., Idarrou, A., Bouzit, A., & Mammass, D. (2018). Towards a Novel and Generic Approach for OWL Ontology Weighting. Procedia Computer Science, 127, 426–435. https://doi.org/10.1016/j.procs.2018.01.140 Adhikari, A., Dutta, B., Dutta, A., Mondal, D., & Singh, S. (2018). An intrinsic information content-based semantic similarity measure considering the disjoint common subsumers of concepts of an ontology. Journal of the Association for … …Journal of Computer Science, Vol. 20, Issue 8 · 27 May 2024 · 5,773 accessesView PDF Cite

Research ArticleOpen accessIn the abstractONCObc-ST: An Improved Clinical Reasoning Algorithm Based on Select and Test (ST) Algorithm for Diagnosing Breast CancerOlaide Nathaniel Oyelade, Sunday Adeyemi AdewuyiThe need for an accurate reasoning algorithm is usually necessitated by the sensitivity of domain of (medicine as example) application of such algorithms. Most reasoning algorithms for medical diagnosis are either limited by their techniques or accuracy and efficiency. Even the Select and Test (ST) algorithm which is considered a more approximate reasoning algorithm is also limited by its approach … …Current Research in Bioinformatics, Vol. 8, Issue 1 · 15 Apr 2019 · 7,162 accessesView PDF Cite

Research ArticleOpen accessIn the abstractOptimized Crossover Genetic Algorithm for Vehicle Routing Problem with Time WindowsH. Nazif, L.S. LeeProblem statement: In this study, we considered the application of a genetic algorithm to vehicle routing problem with time windows where a set of vehicles with limits on capacity and travel time are available to service a set of customers with demands and earliest and latest time for serving. The objective is to find routes for the vehicles to service … …American Journal of Applied Sciences, Vol. 7, Issue 1 · 31 Jan 2010 · 8,975 accessesView PDF Cite