Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

4 articles for “complete 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 PDFCite
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 PDFCite
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 PDFCite
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 PDFCite