-
Chapter and Conference Paper
An Intelligent Online Judge System for Programming Training
Online judge (OJ) systems are becoming increasingly popular in various applications such as programming training, competitive programming contests and even employee recruitment, mainly due to their ability of ...
-
Chapter and Conference Paper
Incremental Algorithms for Sampling Dynamic Graphs
Among the many reasons that justify the need for efficient and effective graph sampling algorithms is the ability to replace a graph too large to be processed by a tractable yet representative subgraph. For in...
-
Chapter and Conference Paper
Sampling Connected Induced Subgraphs Uniformly at Random
A recurrent challenge for modern applications is the processing of large graphs. The ability to generate representative samples of smaller size is useful not only to circumvent scalability issues but also, per...
-
Chapter and Conference Paper
Fast Identity Anonymization on Graphs
Liu and Terzi proposed the notion of k-degree anonymity to address the problem of identity anonymization in graphs. A graph is k-degree anonymous if and only if each of its vertices has the same degree as that of...
-
Chapter and Conference Paper
Generating Random Graphic Sequences
The graphs that arise from concrete applications seem to correspond to models with prescribed degree sequences. We present two algorithms for the uniform random generation of graphic sequences. We prove their ...
-
Chapter and Conference Paper
A Simple, Yet Effective and Efficient, Sliding Window Sampling Algorithm
Sampling streams of continuous data with limited memory, or reservoir sampling, is a utility algorithm. Standard reservoir sampling maintains a random sample of the entire stream as it has arrived so far. This...