DAM
2011
13 years 4 months ago
2011
Linguists often represent the relationships between words in a collection of text as an undirected graph G = (V, E), were V is the vocabulary and vertices are adjacent in G if and...
DAM
2011
13 years 7 months ago
2011
DAM
2011
13 years 7 months ago
2011
In this paper we show that the problem to decide whether the hamiltonian index of a given graph is less or equal to a given constant is ∗ Research supported by grants No. 1M0545...
DAM
2011
13 years 7 months ago
2011
DAM
2011
13 years 7 months ago
2011
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...
DAM
2011
13 years 7 months ago
2011
The \Cross Product" technique introduced by Even and Litman EL92] is extended into a fulldecompositiontheory enablinga unique (up to isomorphism)and polynomialfactorizationof...
DAM
2011
13 years 7 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
DAM
2011
13 years 7 months ago
2011
In this paper we tackle the problem of matching two colored point sets in R3 under the bottleneck distance. First we present an exact matching algorithm that requires the computat...
DAM
2011
13 years 7 months ago
2011
An edge-labeling λ for a directed graph G has a weak sense of direction (WSD) if there is a function f that satisfies the condition that for any node u and for any two label seq...
DAM
2011
13 years 7 months ago
2011
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v, u, x, y) of vertices such that both (v, u, x) and (u, x, y) are paths of length two. The 3-arc graph of a graph ...