4865 search results - page 562 / 973 » The Complexity of Graph Connectivity |
144
click to vote
AML
2005
15 years 6 months ago
2005
When we cut a multiplicative proof-net of linear logic in two parts we get two modules with a certain border. We call pretype of a module the set of partitions over its border indu...
180
click to vote
ALGORITHMICA
2002
15 years 6 months ago
2002
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...
119
click to vote
JCSS
1998
15 years 6 months ago
1998
d Abstract) LYDIA E. KAVRAKI JEAN-CLAUDE LATOMBE RAJEEV MOTWANI ¡ PRABHAKAR RAGHAVAN ¢ The subject of this paper is the analysis of a randomized preprocessing scheme that ...
140
Voted
PAMI
1998
15 years 6 months ago
1998
—In this paper, we describe a flexible form-reader system capable of extracting textual information from accounting documents, like invoices and bills of service companies. In th...
166
Voted
MST
2010
15 years 5 months ago
2010
We initiate the first systematic study of the NP-hard Cluster Vertex Deletion (CVD) problem (unweighted and weighted) in terms of fixed-parameter algorithmics. In the unweighted...