29 search results - page 5 / 6 » Coloring a Graph Using Split Decomposition |
SOFTVIS
2010
ACM
13 years 3 months ago
2010
ACM
Reverse engineering methods produce different descriptions of software architectures. In this work we analyze and define the task of exploring and comparing these descriptions. ...
RSA
2008
13 years 4 months ago
2008
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
AAAI
1996
13 years 6 months ago
1996
We describe a framework for robot navigation that exploits the continuity of image sequences. Tracked visual features both guide the robot and provide predictive information about...
PLDI
2003
ACM
13 years 10 months ago
2003
ACM
An adaptation of the classic register allocation algorithm to the problem of array storage optimization in MATLAB is presented. The method involves the decomposition of an interfe...