Sciweavers

7986 search results - page 158 / 1598
» Computational Science and its Applications
Sort
View
SODA
1992
ACM
123views Algorithms» more  SODA 1992»
14 years 11 months ago
Computing Minimal Spanning Subgraphs in Linear Time
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, ...
89
Voted
ITICSE
2004
ACM
15 years 3 months ago
Teaching computer networking with the help of personal computer networks
This paper describes an “experiential” learning approach to teaching a foundational course on Computer Networking. In additional to the traditional laboratory sessions and ana...
Rocky K. C. Chang
106
Voted
WG
2009
Springer
15 years 4 months ago
Fully Dynamic Representations of Interval Graphs
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...
Christophe Crespelle
81
Voted
HOA
1993
15 years 2 months ago
The Semantics of SPECTRUM
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...
Radu Grosu, Franz Regensburger
ISSAC
2009
Springer
149views Mathematics» more  ISSAC 2009»
15 years 4 months ago
Interoperating between computer algebra systems: computing homology of groups with kenzo and GAP
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 ...
Ana Romero, Graham Ellis, Julio Rubio