370 search results - page 31 / 74 » Computational Study on Dominating Set Problem of Planar Grap... |
104
click to vote
COMPGEOM
2004
ACM
15 years 7 months ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
105
click to vote
SEMWEB
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Ontologies are tools for describing and structuring knowledge, with many applications in searching and analyzing complex knowledge bases. Since building them manually is ...
120
click to vote
SDM
2009
SIAM
15 years 11 months ago
2009
SIAM
In this paper, we study efficient closed pattern mining in a general framework of set systems, which are families of subsets ordered by set-inclusion with a certain structure, pro...
ECCV
2010
Springer
15 years 7 months ago
2010
Springer
The study of 2D shapes is a central problem in the field of computer vision. In 2D shape analysis, classification and recognition of objects from their observed silhouette are e...
109
click to vote
ICTCS
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We study efficient exact algorithms for several problems including Vertex Bipartization, Feedback Vertex Set, 3-Hitting Set, Max Cut in graphs with maximum degree at most...