This is my solo project for the course CS163 of HCMUS's APCS. The application can visualize hash table, binary tree, AVL tree, 2-3 tree, 2-3-4 tree, heap, trie, and graph.
Abstract: We address a variant of the Steiner tree problem for delay constrained problems. The addressed problem consists in determining the minimum cost Steiner tree, while guaranteeing that the ...
Opinionated Python bindings for the tree-sitter-stack-graphs rust library. It exposes a minimal, opinionated API to leverage the stack-graphs library for reference resolution in source code. The rust ...
The recent past has seen an increasing interest in Heterogeneous Graph Neural Networks (HGNNs), since many real-world graphs are heterogeneous in nature, from citation graphs to email graphs. However, ...
We consider the detection of activations over graphs under Gaussian noise, where signals are piece-wise constant over the graph. Despite the wide applicability of such a detection algorithm, there has ...
Abstract: Scientific applications are commonly modeled as the processing of directed acyclic graphs of tasks, and for some of them, the graph takes the special form of a rooted tree. This tree ...
This article was subjected to a comprehensive fact-checking process. Our professional fact-checkers verify article information against primary sources, reputable publishers, and experts in the field.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback