Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, ...
This paper describes an “experiential” learning approach to teaching a foundational course on Computer Networking. In additional to the traditional laboratory sessions and ana...
We present a fully dynamic algorithm that maintains three different representations of an interval graph: a minimal interval model of the graph, the PQ-tree of its maximal cliques...
Abstract. The Spectrum project concentrates on the process of developing well-structured, precise system speci cations. Spectrum is a speci cation language, with a deduction calcul...
In this paper we report on an experience communicating two computer algebra systems, namely GAP (and more concretely, its HAP package to compute in Homological Algebra) and Kenzo ...