Sciweavers

2853 search results - page 449 / 571
» Finding related tables
Sort
View
COMBINATORICS
1999
90views more  COMBINATORICS 1999»
13 years 7 months ago
On the Theory of Pfaffian Orientations. II. T-joins, k-cuts, and Duality of Enumeration
This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...
Anna Galluccio, Martin Loebl
DAM
1999
128views more  DAM 1999»
13 years 7 months ago
Graph Classes Between Parity and Distance-hereditary Graphs
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
Serafino Cicerone, Gabriele Di Stefano
JSS
2002
107views more  JSS 2002»
13 years 7 months ago
On the attractiveness of the star network
In defiance of the tremendous research the star network had attracted during the last decade, no parallel machine based on this network has yet been built. In this paper, we explo...
Abdel Elah Al-Ayyoub, Khaled Day, Abdullah Al-Dhel...
PAMI
2002
184views more  PAMI 2002»
13 years 7 months ago
Identifying Faces in a 2D Line Drawing Representing a Manifold Object
A straightforward way to illustrate a 3D model is to use a line drawing. Faces in a 2D line drawing provide important information for reconstructing its 3D geometry. Manifold objec...
Jianzhuang Liu, Yong Tsui Lee, Wai-kuen Cham
RE
2002
Springer
13 years 7 months ago
Converging on the Optimal Attainment of Requirements
Planning for the optimal attainment of requirements is an important early lifecycle activity. However, such planning is difficult when dealing with competing requirements, limited...
Martin S. Feather, Tim Menzies