446 search results - page 62 / 90 » A fast algorithm for computing steiner edge connectivity |
CG
2005
Springer
13 years 7 months ago
2005
Springer
This paper presents an intuitive, freehand sketching application for Computer Aided Design (CAD) that can reconstruct a 3D object from a single, flat, freehand sketch. A pen is us...
ACCV
1998
Springer
13 years 11 months ago
1998
Springer
One of the important problems related to image analysis and compression is finding repeated structure. Although the focus of this paper is developing digital geometric models and m...
MFCS
2004
Springer
14 years 27 days ago
2004
Springer
Let G = (V, E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of (source-sink) pairs of vertices of G, an important problem that arises in the computat...
ALGORITHMICA
2011
13 years 2 months ago
2011
We show that computing the crossing number and the odd crossing number of a graph with a given rotation system is NP-complete. As a consequence we can show that many of the well-k...
BMCBI
2006
13 years 7 months ago
2006
Background: After complete sequencing of a number of genomes the focus has now turned to proteomics. Advanced proteomics technologies such as two-hybrid assay, mass spectrometry e...