99 search results - page 5 / 20 » On a class of finite symmetric graphs |
DISOPT
2008
13 years 8 months ago
2008
At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cu...
PODS
2004
ACM
14 years 8 months ago
2004
ACM
Unions of conjunctive queries, also known as select-project-join-union queries, are the most frequently asked queries in relational database systems. These queries are definable b...
COMBINATORICA
2006
13 years 8 months ago
2006
Given a universal binary countable homogeneous structure U and n , there is a partition of the induced n-element substructures of U into finitely many classes so that for any par...
INFOCOM
2011
IEEE
12 years 12 months ago
2011
IEEE
—We consider the problem of maximizing the throughput of Byzantine agreement, when communication links have finite capacity. Byzantine agreement is a classical problem in distri...
ICALP
2000
Springer
14 years 16 hour ago
2000
Springer
Message Sequence Charts (MSCs) are an attractive visual formalism widely used to capture system requirements during the early design stages in domains such as telecommunication sof...