Computing distance-based topological descriptors of complex chemical networks: New theoretical techniques
S Hayat - Chemical Physics Letters, 2017 - Elsevier
Abstract Structure-based topological descriptors/indices of complex chemical networks
enable prediction of physico-chemical properties and the bioactivities of these compounds …
enable prediction of physico-chemical properties and the bioactivities of these compounds …
The graph spectrum of barycentric refinements
O Knill - arXiv preprint arXiv:1508.02027, 2015 - arxiv.org
Given a finite simple graph G, let G'be its barycentric refinement: it is the graph in which the
vertices are the complete subgraphs of G and in which two such subgraphs are connected, if …
vertices are the complete subgraphs of G and in which two such subgraphs are connected, if …
A Java Application for Teaching Graphs in Undergraduate Courses
V Migallón, J Penadés - Applied Sciences, 2023 - mdpi.com
Graph theory is a common topic that is introduced as part of the curricula of computing
courses such as Computer Science, Computer Engineering, Data Science, Information …
courses such as Computer Science, Computer Engineering, Data Science, Information …
Debugging tool to learn algorithms: A case study minimal spanning tree
AY Khedr, HM Bahig - International Journal of Emerging …, 2017 - search.proquest.com
This paper presents a visualization tool that works as a debugger to learn the minimal
spanning tree. The tool allows the user to enter the graph as a matrix and then allow the …
spanning tree. The tool allows the user to enter the graph as a matrix and then allow the …
Illustrating a graph coloring algorithm based on the principle of inclusion and exclusion using GraphTea
MA Rostami, HM Bücker, A Azadi - European Conference on Technology …, 2014 - Springer
Graph theory is becoming increasingly important in various scientific disciplines. The graph
coloring problem is an abstraction of partitioning entities in the presence of conflicts. It is …
coloring problem is an abstraction of partitioning entities in the presence of conflicts. It is …
A framework to learn graph theory using simple wireless network models
A Dapena, FJ Vázquez‐Araujo… - Computer …, 2016 - Wiley Online Library
In order to improve the student learning process, we present a framework to define attractive
computer laboratory lessons in Engineering Degrees. Theoretical concepts are illustrated …
computer laboratory lessons in Engineering Degrees. Theoretical concepts are illustrated …
Investigating the Effect of a Mobile Learning Application for Graph Theory Education on Academic Performance
B Ciloglugil, MM Inceoglu - … Science and Its Applications–ICCSA 2020 …, 2020 - Springer
In this study, the effectiveness of using a mobile learning application developed for graph
theory education is investigated by evaluating its impact on the academic performance of …
theory education is investigated by evaluating its impact on the academic performance of …
Implementation of a planarity testing method using PQ-trees
AW Cregten, HK Hannesson - 2017 - skemman.is
Vefsíðan GTea er kynnt, þar hafa verið útfærð tvö lagneta-prófana reiknirit. Af þessum
reikniritum, þá nýtir annað sér jarðýtu aðferð, á meðan hitt er skilvirkara reiknirit sem nýtir sér …
reikniritum, þá nýtir annað sér jarðýtu aðferð, á meðan hitt er skilvirkara reiknirit sem nýtir sér …
[图书][B] Graph Playground: A Pedagogic Tool for Graph Theory and Algorithms
N Adhikari - 2021 - search.proquest.com
A system called Graph Playground has been created to enhance the teaching of introductory
graph theory and graph algorithms presented in courses like CSC 340, Applied …
graph theory and graph algorithms presented in courses like CSC 340, Applied …
Multimedia data dissemination in opportunistic systems
M Klaghstan - 2016 - theses.hal.science
Opportunistic networks are human-centric mobile ad-hoc networks, in which neither the
topology nor the participating nodes are known in advance. Routing is dynamically planned …
topology nor the participating nodes are known in advance. Routing is dynamically planned …