365 search results - page 71 / 73 » On the combinatorics of Galois numbers |
203
click to vote
DAM
2011
15 years 1 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...
237
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
146
click to vote
COCOON
2007
Springer
16 years 26 days ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
163
click to vote
GECCO
2007
Springer
16 years 25 days ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
185
click to vote
COCOON
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. We study the interval subset sum problem (ISSP), a generalization of the classic subset-sum problem, where given a set of intervals, the goal is to choose a set of intege...