DAM
2008
13 years 11 months ago
2008
DAM
2008
13 years 11 months ago
2008
DAM
2008
13 years 11 months ago
2008
A vertex-cut X is said to be a restricted cut of a graph G if it is a vertex-cut such that no vertex u in G has all its neighbors in X. Clearly, each connected component of G - X ...
DAM
2008
13 years 11 months ago
2008
We present here a systematic study of general boundary value problems on weighted networks that includes the variational formulation of such problems. In particular, we obtain the...
DAM
2008
13 years 11 months ago
2008
We describe the most efficient solutions to the word problem of Artin's braid group known so far, i.e., in other words, the most efficient solutions to the braid isotopy probl...
DAM
2008
13 years 11 months ago
2008
13 An induced matching of a graph G is a matching having no two edges joined by14 an edge. An efficient edge dominating set of G is an induced matching M such that15 every other ed...
DAM
2008
13 years 11 months ago
2008
In this paper, we address the following problem: given a synchronous digital circuit, is it possible to construct a new circuit computing the same function as the original one but...
DAM
2008
13 years 11 months ago
2008
The NP-complete Closest 4-Leaf Power problem asks, given an undirected graph, whether it can be modified by at most r edge insertions or deletions such that it becomes a 4-leaf po...
DAM
2008
13 years 11 months ago
2008
Packet reordering is an important property of network traffic that should be captured by analytical models of the Transmission Control Protocol (TCP). We study a combinatorial pro...
DAM
2008
13 years 11 months ago
2008
We give an overview on twisting commutative algebraic groups and applications to discrete log based cryptography. We explain how discrete log based cryptography over extension fie...