Designing highly functional and practical coding-algorithms of plane graphs

点击翻译按钮获取中文摘要

In this research, we have designed some coding algorithms for important subclasses of plane graphs. First, we define a subclass of ordered trees which has a 1-to-1 correspondence to a class of rooted trees, and design a compact code for such ordered tree. For grid rectangular drawings and mosaic floorplans, which have applications to VLSI design, we proposed some compact codes. We also proposed a compact code for optimal ladder lotteries. Using the code, we give an upper bound for the number of optimal ladder lotteries.