20 search results - page 1 / 4 » Ordered Ramsey numbers of loose paths and matchings |
GC
2011
Springer
13 years 5 months ago
2011
Springer
The Ramsey number r(H, Kn) is the smallest positive integer N such that every graph of order N contains either a copy of H or an independent set of size n. The Tur´an number ex(m,...
JAIR
2008
13 years 10 months ago
2008
We represent planning as a set of loosely coupled network flow problems, where each network corresponds to one of the state variables in the planning domain. The network nodes cor...
SIAMDM
2010
13 years 5 months ago
2010
We consider a matching market, in which the aim is to maintain a popular matching between a set of applicants and a set of posts, where each applicant has a preference list rankin...
JACM
2007
13 years 10 months ago
2007
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed ...
ICON
2007
IEEE
14 years 5 months ago
2007
IEEE
—Inter-domain routing is suffering from the lack of identifiers for the rapidly growing number of Autonomous Systems (AS), and therefore the 4-byte AS number has been proposed a...