721 search results - page 74 / 145 » Bounds on the k-domination number of a graph |
175
click to vote
IJCV
2012
13 years 8 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...
176
click to vote
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 ...
140
click to vote
SOFSEM
1997
Springer
15 years 10 months ago
1997
Springer
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
176
click to vote
GD
1998
Springer
15 years 10 months ago
1998
Springer
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
135
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...