43 search results - page 5 / 9 » Complexity of the Mixed Postman Problem with Restrictions on... |
AE
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...
STOC
1998
ACM
14 years 24 days ago
1998
ACM
Current formal models for quantum computation deal only with unitary gates operating on “pure quantum states”. In these models it is difficult or impossible to deal formally w...
ICC
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...
HPCN
1995
Springer
14 years 3 days ago
1995
Springer
In the global economy, proper organisation and planning of production and storage locations, transportation and scheduling are vital to retain the competitive edge of companies. Th...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Deciding whether a graph can be embedded in a grid using only unitlength edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a numbe...