1629 search results - page 124 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
MTA
2011
14 years 5 months ago
2011
As a result of improvements in wireless communication technologies, a multimedia data streaming service can now be provided for mobile clients. Since mobile devices have low comput...
EUSFLAT
2009
14 years 7 months ago
2009
Group technology (GT) is a useful way to increase productivity with high quality in cellular manufacturing systems (CMSs), in which cell formation (CF) is a key step in the GT phil...
ALT
2007
Springer
15 years 7 months ago
2007
Springer
We consider the problem of learning and verifying hidden graphs and their properties given query access to the graphs. We analyze various queries (edge detection, edge counting, sh...
JGAA
2002
14 years 9 months ago
2002
The merit of automatic graph layout algorithms is typically judged by their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minim...
DISOPT
2010
14 years 10 months ago
2010
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...