219 search results - page 21 / 44 » Maximum common subgraph: some upper bound and lower bound re... |
102
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by looking at their corresponding labels. T...
119
click to vote
COMGEO
2011
ACM
14 years 8 months ago
2011
ACM
We prove that n cops can capture (that is, some cop can get less than unit distance from) a robber in a continuous square region with side length less than √ 5n and hence that n/...
114
click to vote
FSTTCS
2010
Springer
14 years 11 months ago
2010
Springer
This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of func...
110
click to vote
CIAC
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
CORR
2002
Springer
15 years 1 months ago
2002
Springer
Different types of two- and three-dimensional representations of a finite metric space are studied that focus on the accurate representation of the linear order among the distance...