72 search results - page 2 / 15 » On the Complements of Partial k-Trees |
DM
2008
13 years 5 months ago
2008
This paper discusses the game colouring number of partial k-trees and planar graphs. Let colg(PT k) and colg(P) denote the maximum game colouring number of partial k trees and the...
EDBT
2010
ACM
13 years 12 months ago
2010
ACM
The goal of data fusion is to combine several representations of one real world object into a single, consistent representation, e.g., in data integration. A very popular operator...
ASAP
2007
IEEE
13 years 7 months ago
2007
IEEE
This paper presents an optimized design approach of two’s complement large-size squarers using embedded multipliers in FPGAs. The realization is based on BaughWooley’s algorit...
DAM
2011
13 years 12 days 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...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
In a previous work we introduced slice graphs as a way to specify both infinite languages of directed acyclic graphs (DAGs) and infinite languages of partial orders. Therein we fo...