Sciweavers

446 search results - page 60 / 90
» A Combinatorial Theorem for Trees
Sort
View
COMPGEOM
1993
ACM
15 years 3 months ago
Worst-Case Bounds for Subadditive Geometric Graphs
We consider graphs such as the minimum spanning tree, minimum Steiner tree, minimum matching, and traveling salesman tour for n points in the d-dimensional unit cube. For each of ...
Marshall W. Bern, David Eppstein
ECCE
2007
15 years 3 months ago
Intelligent decision support in medicine: back to Bayes?
: Decision Support Systems are proliferating rapidly in many areas of human endeavour including clinical medicine and psychology. While these are typically based on rulebased syste...
Gitte Lindgaard
ENTCS
2008
103views more  ENTCS 2008»
14 years 12 months ago
Systematic Semantic Tableaux for PLTL
The better known methods of semantic tableaux for deciding satisfiability in propositional linear temporal logic generate graphs in addition to classical trees. The test of satisf...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...
JSYML
2008
100views more  JSYML 2008»
14 years 11 months ago
Measurable chromatic numbers
We show that if add(null) = c, then the globally Baire and universally measurable chromatic numbers of the graph of any Borel function on a Polish space are equal and at most three...
Benjamin D. Miller
ACTA
2000
104views more  ACTA 2000»
14 years 11 months ago
Some results on the Collatz problem
The paper refers to the Collatz's conjecture. In the first part, we present some equivalent forms of this conjecture and a slight generalization of a former result from [1]. T...
Stefan Andrei, Manfred Kudlek, Radu Stefan Nicules...