6740 search results - page 138 / 1348 » An s -Hamiltonian Line Graph Problem |
DAM
2006
13 years 10 months ago
2006
In a previous work, we proposed a new integer programming formulation for the graph coloring problem which, to a certain extent, avoids symmetry. We studied the facet structure of...
CONEXT
2010
ACM
13 years 8 months ago
2010
ACM
Traditional DSL troubleshooting solutions are reactive, relying mainly on customers to report problems, and tend to be labor-intensive, time consuming, prone to incorrect resoluti...
ICIP
2002
IEEE
14 years 12 months ago
2002
IEEE
Perspective distortion always occurs while scanning thick, bound documents, resulting in two problems in the scanned grayscale image ? (i) shade along the `spine' of the book...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
A celebrated theorem of Savitch [Sav70] states that NSPACE(S) ⊆ DSPACE(S2 ). In particular, Savitch gave a deterministic algorithm to solve ST-CONNECTIVITY (an NL-complete probl...
WDAG
2007
Springer
14 years 4 months ago
2007
Springer
We consider the problem of minimizing the number of ADMs in optical networks. All previous theoretical studies of this problem dealt with the off-line case, where all the lightpat...