496 search results - page 51 / 100 » C4-saturated bipartite graphs |
147
click to vote
DAM
2006
15 years 6 months ago
2006
Given a rectangular array where entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each colo...
160
click to vote
COCOON
2003
Springer
15 years 11 months ago
2003
Springer
We investigate hamiltonian properties of Pm × Cn, m ≥ 2 and even n ≥ 4, which is bipartite, in the presence of faulty vertices and/or edges. We show that Pm×Cn with n even is...
155
click to vote
SIGIR
2008
ACM
15 years 6 months ago
2008
ACM
We present a novel passage-based approach to re-ranking documents in an initially retrieved list so as to improve precision at top ranks. While most work on passage-based document...
161
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
135
click to vote
SWAT
2004
Springer
15 years 11 months ago
2004
Springer
In this paper we introduce a new notion of collective tree spanners. We say that a graph G = (V, E) admits a system of µ collective additive tree r-spanners if there is a system T...