1633 search results - page 146 / 327 » Planar Map Graphs |
84
Voted
CORR
2010
Springer
15 years 23 days ago
2010
Springer
Consider a routing problem instance consisting of a demand graph H = (V, E(H)) and a supply graph G = (V, E(G)). If the pair obeys the cut condition, then the flow-cut gap for thi...
79
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...
127
Voted
IJWMC
2010
14 years 10 months ago
2010
Coverage, fault tolerance and power consumption constraints make optimal placement of mobile sensors or other mobile agents a hard problem. We have developed a model for describin...
ENDM
2007
15 years 19 days ago
2007
For a graph G and an integer t we let mcct(G) be the smallest m such that there exists a coloring of the vertices of G by t colors with no monochromatic connected subgraph having ...
110
Voted
ICCV
2007
IEEE
15 years 7 months ago
2007
IEEE
In this study, we address the problem of 3-D dense metric reconstruction and registration from multiple images, given that the observed surface is nearly planar. This is difficult...