2294 search results - page 148 / 459 » From Path Graphs to Directed Path Graphs |
EURODAC
1994
IEEE
15 years 2 months ago
1994
IEEE
The use of a realistic component library with multiple implementations of operators, results in cost ef cient designs; slow components can then be used on non-critical paths and t...
APPROX
2006
Springer
15 years 1 months ago
2006
Springer
Consider the following problem: For given graphs G and F1, . . . , Fk, find a coloring of the edges of G with k colors such that G does not contain Fi in color i. For example, if e...
EJC
2007
14 years 10 months ago
2007
We investigate the historical roots of the field of combinatorics on words. They comprise applications and interpretations in algebra, geometry and combinatorial enumeration. The...
108
click to vote
CPM
1993
Springer
15 years 2 months ago
1993
Springer
It is widely accepted that the optimal alignment between a pair of proteins or nucleic acid sequences that minimizes the edit distance may not necessarily re
ect the correct biolog...
DAM
2010
14 years 10 months ago
2010
We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if an...