Sciweavers

641 search results - page 103 / 129
» On Planar Quasi-Parity Graphs
Sort
View
GC
2010
Springer
14 years 8 months ago
Polyhedral Suspensions of Arbitrary Genus
A new class of polyhedra is discovered—bipyramids of arbitrarily prescribed genus. A two-dimensional generalization of Fáry’s Theorem is established. A purely combinatorial de...
Serge Lawrencenko
MOR
2010
111views more  MOR 2010»
14 years 8 months ago
Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem
We extend the work of Letchford (2000) by introducing a new class of valid inequalities for the traveling salesman problem, called the generalized domino-parity (GDP) constraints....
William J. Cook, Daniel G. Espinoza, Marcos Goycoo...
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
15 years 1 months ago
Dynamic Programming and Fast Matrix Multiplication
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
Frederic Dorn
VMV
2003
143views Visualization» more  VMV 2003»
14 years 11 months ago
Animating a Camera for Viewing a Planar Polygon
Many applications, ranging from visualization applications such as architectural walkthroughs to robotic applications such as surveillance, could benefit from an automatic camera ...
Daniel Brunstein, Gill Barequet, Craig Gotsman
CORR
2004
Springer
111views Education» more  CORR 2004»
14 years 9 months ago
Layout of Graphs with Bounded Tree-Width
A queue layout of a graph consists of a total order of the vertices, and a partition of the edges into queues, such that no two edges in the same queue are nested. The minimum numb...
Vida Dujmovic, Pat Morin, David R. Wood