Sciweavers

9532 search results - page 82 / 1907
» Logic, Graphs, and Algorithms
Sort
View
ISAAC
2009
Springer
131views Algorithms» more  ISAAC 2009»
15 years 5 months ago
A Certifying Algorithm for 3-Colorability of P5-Free Graphs
We provide a certifying algorithm for the problem of deciding whether a P5-free graph is 3-colorable by showing there are exactly six finite graphs that are P5-free and not 3-colo...
Daniel Bruce, Chính T. Hoàng, Joe Sa...
ICPR
2006
IEEE
16 years 8 days ago
An Efficient Radical-Based Algorithm for Stroke-Order-Free Online Kanji Character Recognition
This paper investigates improvements of an online handwriting stroke-order analysis algorithm -- cube search, based on cube graph stroke-order generation model and dynamic program...
Hiroaki Sakoe, Seiichi Uchida, Wenjie Cai
CCCG
2010
15 years 19 days ago
A new algorithm and improved lower bound for point placement on a line in two rounds
In this paper we show how to construct in 2 rounds a line-rigid point placement graph of size 4n/3+O(1) from small graphs called 6:6 jewels, an extension of the 4:4 jewel of [3]. ...
Md. Shafiul Alam, Asish Mukhopadhyay
ICCAD
1999
IEEE
84views Hardware» more  ICCAD 1999»
15 years 3 months ago
Timing-driven partitioning for two-phase domino and mixed static/domino implementations
Domino logic is a high-performance circuit configuration that is usually embedded in static logic environment and tightly coupled with the clocking scheme. In this paper, the timi...
Min Zhao, Sachin S. Sapatnekar
IPPS
1998
IEEE
15 years 3 months ago
Ultrafast Randomized Parallel Construction and Approximation Algorithms for Spanning Forests in Dense Graphs
We present a rst randomized Ologk n time and On+m work CRCWPRAM algorithm for nding a spanning forest of an undirected dense graph with n vertices. Furthermore we construct a rando...
Anders Dessmark, Carsten Dorgerloh, Andrzej Lingas...