1105 search results - page 108 / 221 » Linear choosability of graphs |
158
click to vote
HPCC
2005
Springer
15 years 10 months ago
2005
Springer
Structured data represented in the form of graphs arises in several fields of the science and the growing amount of available data makes distributed graph mining techniques partic...
175
click to vote
EUROPAR
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We use a parallel direct solver based on the Schur complement method for solving large sparse linear systems arising from the finite element method. A domain decompositi...
144
click to vote
CAV
2003
Springer
15 years 9 months ago
2003
Springer
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
139
click to vote
IPPS
2002
IEEE
15 years 9 months ago
2002
IEEE
In this paper, we propose a new distributed algorithm that constructs a sparse spanner subgraph of the unit disk graph efficiently for wireless ad hoc networks. It maintains a li...
141
click to vote
CC
2006
Springer
15 years 8 months ago
2006
Springer
As register allocation is one of the most important phases in optimizing compilers, much work has been done to improve its quality and speed. We present a novel register allocation...