1986 search results - page 235 / 398 » Path Separability of Graphs |
123
click to vote
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
This paper studies labeling schemes for the vertex connectivity function on general graphs. We consider the problem of labeling the nodes of any n-node graph is such a way that gi...
100
Voted
DIAL
2006
IEEE
15 years 8 months ago
2006
IEEE
It is an important topic for segmentation on how to merge the over-segmented subimages of characters into integral characters. The conventional character segmentation has been mos...
125
Voted
ICRA
2006
IEEE
15 years 8 months ago
2006
IEEE
Abstract— In this paper, we present an incremental, multiresolution motion planning algorithm designed for systems with differential constraints. Planning for these sytems is mor...
92
Voted
IROS
2006
IEEE
15 years 8 months ago
2006
IEEE
— This paper formalizes and proposes an algorithm to compute coverage diameters of polygons in 2D. Roughly speaking, the coverage diameter of a polygon is the longest possible di...
122
Voted
SPAA
2005
ACM
15 years 8 months ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...