684 search results - page 46 / 137 » A characterization of b-perfect graphs |
121
Voted
ICRA
2007
IEEE
15 years 8 months ago
2007
IEEE
— Computing optimal paths for mobile robots is an interesting and important problem. This paper presents a method to compute the shortest path for a differential-drive mobile rob...
132
click to vote
SMA
2003
ACM
15 years 7 months ago
2003
ACM
In this paper a graph-based method is presented which not only characterizes topological classification of the tessellated surfaces but also simultaneously generates the substanti...
DM
2008
15 years 1 months ago
2008
Let G = (V, E) be a graph. A set S V is a total restrained dominating set if every vertex is adjacent to a vertex in S and every vertex of V - S is adjacent to a vertex in V - S....
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
— We take a structural approach to the problem of designing the edge weights in an undirected graph subject to an upper bound on their total, so as to maximize the algebraic conn...
122
Voted
CORR
2007
Springer
15 years 1 months ago
2007
Springer
— Max-product belief propagation is a local, iterative algorithm to find the mode/MAP estimate of a probability distribution. While it has been successfully employed in a wide v...