Sciweavers

Share
DAM
2011
7 years 12 months ago
Triangular line graphs and word sense disambiguation
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...
Pranav Anand, Henry Escuadro, Ralucca Gera, Craig ...
DAM
2011
8 years 2 months ago
Hamiltonian index is NP-complete
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...
Zdenek Ryjácek, Gerhard J. Woeginger, Limin...
DAM
2011
8 years 3 months ago
On minimal Sturmian partial words
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...
Francine Blanchet-Sadri, John Lensmire
DAM
2011
8 years 3 months ago
A theory of decomposition into prime factors of layered interconnection networks
The \Cross Product" technique introduced by Even and Litman EL92] is extended into a fulldecompositiontheory enablinga unique (up to isomorphism)and polynomialfactorizationof...
Azaria Paz
DAM
2011
8 years 3 months ago
Optimization problems in multiple subtree graphs
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...
Danny Hermelin, Dror Rawitz
DAM
2011
8 years 3 months ago
Noisy colored point set matching
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...
Yago Diez, Joan Antoni Sellarès
DAM
2011
8 years 3 months ago
Weak sense of direction labelings and graph embeddings
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...
Christine T. Cheng, Ichiro Suzuki
DAM
2011
8 years 3 months ago
A study of 3-arc graphs
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 ...
Martin Knor, Guangjun Xu, Sanming Zhou
books