5889 search results - page 475 / 1178 » Graph Layout Problems |
209
click to vote
SIAMDM
2010
15 years 2 months ago
2010
In this paper we consider the problem of computing the expected hitting time to a vertex for random walks on graphs. We give a method for computing an upper bound on the expected ...
210
click to vote
ECCV
2008
Springer
16 years 9 months ago
2008
Springer
Abstract. Mathematical Morphology (MM) offers a wide range of operators to address various image processing problems. These processing can be defined in terms of algebraic set or a...
199
click to vote
GLOBECOM
2008
IEEE
16 years 2 months ago
2008
IEEE
— A novel, practical and low-complexity multi-cell OFDMA downlink channel assignment method using a graphbased approach is proposed in this work. The inter-cell interference (ICI...
176
click to vote
ISAAC
2005
Springer
16 years 1 months ago
2005
Springer
Let G = (V, E) be an undirected graph, and let B ⊆ V × V be a collection of vertex pairs. We give an incremental polynomial time algorithm to enumerate all minimal edge sets X â...
178
click to vote
ICALP
2010
Springer
16 years 15 days ago
2010
Springer
Abstract. We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique ap...