990 search results - page 52 / 198 » Sub-Graphs of Complete Graph |
FAW
2009
Springer
14 years 3 months ago
2009
Springer
We give a linear-time algorithm for computing the edge search number of cographs, thereby proving that this problem can be solved in polynomial time on this graph class. With our ...
RE
2002
Springer
13 years 8 months ago
2002
Springer
This paper presents an extended version of GoalOriented Requirements Analysis Method called AGORA, where attribute values, e.g. contribution values and preference matrices, are ad...
NETWORKS
2010
13 years 7 months ago
2010
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
BMVC
2010
13 years 7 months ago
2010
The Texture Fragmentation and Reconstruction (TFR) algorithm has been recently introduced [9] to address the problem of image segmentation by textural properties, based on a suita...
ACCV
2010
Springer
13 years 4 months ago
2010
Springer
We present a method for optimizing the stereo matching process when it is applied to a series of images with similar depth structures. We observe that there are similar regions wit...