217 search results - page 12 / 44 » Elimination Graphs |
TCS
2008
13 years 7 months ago
2008
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...
LCPC
2005
Springer
14 years 1 months ago
2005
Springer
Techniques for global register allocation via graph coloring have been extensively studied and widely implemented in compiler frameworks. This paper examines a particular variant â...
CSMR
2007
IEEE
14 years 1 months ago
2007
IEEE
A dynamic object process graph is a view on the control flow graph from the perspective of a single object. It has been shown that such a graph can be a useful starting point for...
IJRR
2006
13 years 7 months ago
2006
This article presents GraphSLAM, a unifying algorithm for the offline SLAM problem. GraphSLAM is closely related to a recent sequence of research papers on applying optimization t...
DAM
1999
13 years 7 months ago
1999
Acyclic cubical complexes have first been introduced by Bandelt and Chepoi in analogy to acyclic simplicial complexes. They characterized them by cube contraction and elimination ...