6598 search results - page 322 / 1320 » Graph Theory with Applications |
137
click to vote
WG
2000
Springer
15 years 10 months ago
2000
Springer
Several practical instances of network design and location theory problems require the network to satisfy multiple constraints. In this paper, we address graph-theoretic problems t...
152
click to vote
DAGSTUHL
2008
15 years 8 months ago
2008
Allowing templates with infinite domains greatly expands the range of problems that can be formulated as a non-uniform constraint satisfaction problem. It turns out that many CSPs ...
215
Voted
APAL
2011
15 years 1 months ago
2011
We formalize the construction of Paterson’s variant of the Ajtai–Koml´os–Szemer´edi sorting network of logarithmic depth in the bounded arithmetical theory VNC1 ∗ (an ex...
167
click to vote
IPPS
2006
IEEE
16 years 21 days ago
2006
IEEE
The ability to understand the factors contributing to parallel program performance are vital for understanding the impact of machine parameters on the performance of specific app...
196
click to vote
ICCS
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. In this paper, we explore the expressivity of default CG rules (a CGoriented subset of Reiter’s default logics) through two applications. In the first one, we show tha...