Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

38

ICALP
1999
Springer

favoriteEmaildiscussreport

134views Programming Languages» more ICALP 1999»

On the Complements of Partial k-Trees

14 years 3 months ago

On the Complements of Partial k-Trees

Download www.cs.sfu.ca

We introduce new techniques for studying the structure of partial k-trees. In particular, we show that the complements of partial k-trees provide an intuitively-appealing characterization of partial k-tree obstructions. We use this characterization to obtain a lower bound of 2 klog k on the number of obstructions, signi cantly improving the previously best-known bound of 2 pk. Our techniques have the added advantage of being considerably simpler than those of previous authors.

Arvind Gupta, Damon Kaller, Thomas C. Shermer

Real-time Traffic

ICALP 1999 | Intuitively-appealing Characterization | Partial K-tree | Partial K-tree Obstructions | Programming Languages |

claim paper

Related Content

» Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial kTrees

» Minimum Sum Multicoloring on the Edges of Planar Graphs and Partial kTrees

» Finding EdgeDisjoint Paths in Partial kTrees

» Partially Complemented Representations of Digraphs

» Lower bounds for the game colouring number of partial ktrees and planar graphs

» Subsumption and complementation as data fusion operators

» FPGABased Efficient Design Approach for LargeSize Twos Complement Squarers

» On minimal Sturmian partial words

» Canonizable Partial Order Generators

Post Info
More Details (n/a)

Added	04 Aug 2010
Updated	04 Aug 2010
Type	Conference
Year	1999
Where	ICALP
Authors	Arvind Gupta, Damon Kaller, Thomas C. Shermer

Comments (0)