1729 search results - page 279 / 346 » Bound Graph Polysemy |
157
click to vote
ICALP
2007
Springer
16 years 9 days ago
2007
Springer
We present a new meshing algorithm for the plane, Overlay Stitch Meshing (OSM), accepting as input an arbitrary Planar Straight Line Graph and producing a triangulation with all an...
174
click to vote
LION
2007
Springer
16 years 8 days ago
2007
Springer
Abstract. In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the ma...
145
click to vote
SOFSEM
2007
Springer
16 years 7 days ago
2007
Springer
We study two aspects of a generalization of the Tower of Hanoi puzzle. In 1981, D. Wood suggested its variant, where a bigger disk may be placed higher than a smaller one if their ...
135
click to vote
ISMVL
2006
IEEE
16 years 4 days ago
2006
IEEE
We define the MaxSAT problem for many-valued CNF formulas, called many-valued MaxSAT, and establish its complexity class. We then describe a basic branch and bound algorithm for ...
182
click to vote
WIOPT
2006
IEEE
16 years 4 days ago
2006
IEEE
— In this paper we investigate the limiting properties, in terms of capacity and delay, of an ad hoc network employing a topology-transparent scheduling scheme. In particular, we...