3928 search results - page 69 / 786 » order 2006 |
103
click to vote
JDA
2006
15 years 4 months ago
2006
We prove that the pathwidth of Halin graphs can be 3-approximated in linear time. Our approximation algorithms is based on a combinatorial result about respectful edge orderings o...
107
click to vote
JSYML
2002
15 years 3 months ago
2002
We point out that a certain complex compact manifold constructed by Lieberman has the dimensional order property, and has U-rank different from Morley rank. We also give a suffici...
151
click to vote
LISP
2006
15 years 3 months ago
2006
We introduce a concrete semantics for floating-point operations which describes the propagation of roundoff errors throughout a calculation. This semantics is used to assert the co...
119
click to vote
COMBINATORICS
2006
15 years 4 months ago
2006
Let N be a nilpotent group normal in a group G. Suppose that G acts transitively upon the points of a finite non-Desarguesian projective plane P. We prove that, if P has square or...
131
click to vote
LMCS
2006
15 years 3 months ago
2006
This article establishes that the split decomposition of graphs introduced by Cunnigham, is definable in Monadic Second-Order Logic.This result is actually an instance of a more ge...