3471 search results - page 461 / 695 » Obstacle Numbers of Graphs |
160
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We consider the problem of finding semi-matching in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms ...
183
Voted
COMGEO
2011
ACM
15 years 1 months ago
2011
ACM
A drawing of a graph in the plane is called a thrackle if every pair of edges meets precisely once, either at a common vertex or at a proper crossing. Let t(n) denote the maximum ...
219
click to vote
TIT
2010
15 years 1 months ago
2010
Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities gene...
187
click to vote
IJCV
2012
13 years 9 months ago
2012
Abstract Computer vision is full of problems elegantly expressed in terms of energy minimization. We characterize a class of energies with hierarchical costs and propose a novel hi...
212
click to vote
COCOON
2009
Springer
16 years 1 months ago
2009
Springer
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...