43 search results - page 1 / 9 » Complexity of the Mixed Postman Problem with Restrictions on... |
ENC
2006
IEEE
13 years 11 months ago
2006
IEEE
ENDM
2007
13 years 5 months ago
2007
COR
2006
13 years 5 months ago
2006
Arc Routing Problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing ...
SIAMDM
2008
13 years 5 months ago
2008
The Windy Postman Problem consists of finding a minimum cost traversal of all the edges of an undirected graph with two costs associated with each edge, representing the costs of ...
ENDM
2010
13 years 5 months ago
2010
Deciding whether an arbitrary graph admits a VLSI layout with unit-length edges is NP-complete [1], even when restricted to binary trees [7]. However, for certain graphs, the prob...