449 search results - page 2 / 90 » Degenerate crossing numbers |
JSCIC
2008
13 years 5 months ago
2008
In this paper we present new efficient variants of structured preconditioners for algebraic linear systems arising from the mortar discretization of a degenerate parabolic system o...
CCCG
2007
13 years 6 months ago
2007
KI
2007
Springer
13 years 11 months ago
2007
Springer
This paper describes a spatio-temporal configurations building approach, which has been applied to dynamics points in 1-dimensional space. In this approach, a temporal logic, Allen...
GD
2006
Springer
13 years 9 months ago
2006
Springer
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrar...
STOC
2001
ACM
14 years 5 months ago
2001
ACM
We show that for every fixed ? there is a quadratic time algorithm that decides whether a given graph has crossing number at most and, if this is the case, computes a drawing of t...