34 search results - page 6 / 7 » New Upper Bound Heuristics for Treewidth |
BROADNETS
2005
IEEE
13 years 11 months ago
2005
IEEE
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
WG
2005
Springer
13 years 11 months ago
2005
Springer
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
CP
2007
Springer
13 years 9 months ago
2007
Springer
Recent research has focused on using the power of look-ahead to speed up the resolution of the Max-SAT problem. Indeed, look-ahead techniques such as Unit Propagation (UP) allow to...
SOFSEM
2007
Springer
13 years 12 months ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
ICPR
2000
IEEE
14 years 6 months ago
2000
IEEE
Medial axis transform (MAT) is a basic tool for shape analysis. But, in spite of its usefulness, it has some drawbacks, one of which is its instability under the boundary perturba...