G

graph

Bus detection is the detection of integrative components within a graph or network structure. The naming is derived from "bus" components in computing and electronics, which are the components that most others are plugged into to distribute power or communication.

Markov chain steady-state calculations with applications in graph clustering and sequencing.

Create a graph from the links on a website and the following sites.

Moved to https://codeberg.org/mek101/img_dedupe_lib

Dirty Code; save speedtest results in database ( your own PHP/Mysql-Webserver); shown as graph; Test-Device must execute a shell-script to start the very simple speedtest (e.g. openwrt)

Graphen und Wegfindung-Algorithmen

greedy & ILP solution for graph coloring problem in R

UT Algorithmic Graph Theory S97 Project 3

mirrored at https://github.com/hadisfr/graph-coloring-r

greedy algorithm for finding minimum dominating set of queen graph

UT Algorithmic Graph Theory S97 Project 3

mirrored at https://github.com/hadisfr/greedy_min_dominating_set_r

part of UT Algorithmic Graph Theory S97 Project 2

mirrored at https://github.com/hadisfr/centrality_r

clustering Game of Thrones relations graph

part of UT Algorithmic Graph Theory S97 Project 2

mirrored at https://github.com/hadisfr/got_clustering_r

A fast heuristic for the prize-collecting Steiner tree problem

part of UT Algorithmic Graph Theory S97 Project 2

mirrored at https://github.com/hadisfr/PCST_r