1933 search results - page 27 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
COMPGEOM
1995
ACM
14 years 7 days ago
1995
ACM
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
SDM
2008
SIAM
13 years 10 months ago
2008
SIAM
The rigid all-versus-all adjacency required by a maximal biclique for its two vertex sets is extremely vulnerable to missing data. In the past, several types of quasi-bicliques ha...
CCCG
2006
13 years 10 months ago
2006
In this paper, we propose an algorithm for computing the farthest-segment Voronoi diagram for the edges of a convex polygon and apply this to obtain an O(n log n) algorithm for th...
ESA
2004
Springer
14 years 2 months ago
2004
Springer
For planar graphs, counting the number of perfect matchings (and hence determining whether there exists a perfect matching) can be done in NC [4, 10]. For planar bipartite graphs, ...
AIEDU
2004
13 years 8 months ago
2004
Learning and reasoning from multiple documents requires students to employ the skills of sourcing (i.e., attending to and citing sources) and information integration (i.e., making ...