148 search results - page 5 / 30 » arc 2006 |
COMBINATORICS
2006
13 years 6 months ago
2006
A homomorphism from an oriented graph G to an oriented graph H is a mapping from the set of vertices of G to the set of vertices of H such that -----(u)(v) is an arc in H whenever...
IPL
2006
13 years 6 months ago
2006
A homomorphism from an oriented graph G to an oriented graph H is an arc-preserving mapping from V (G) to V (H), that is (x)(y) is an arc in H whenever xy is an arc in G. The orie...
MP
2006
13 years 6 months ago
2006
In this paper we introduce a new class of facet-inducing inequalities for the Windy Rural Postman Problem and the Windy General Routing Problem. These inequalities are called Zigz...
NETWORKS
2010
13 years 5 months ago
2010
This paper considers a minimum cost flow problem where arc costs are uncertain, and the decision maker wishes to minimize both the expected flow cost and the variance of this co...
ECCC
2006
13 years 6 months ago
2006
Suppose you ran a chess tournament, everybody played everybody, and you wanted to use the results to rank everybody. Unless you were really lucky, the results would not be acyclic...