6740 search results - page 388 / 1348 » An s -Hamiltonian Line Graph Problem |
145
Voted
ICRA
2005
IEEE
16 years 9 days ago
2005
IEEE
— This paper proposes a necessary and sufficient condition for parallel grasps. We extend the use of this condition to the task of regrasp planning. In particular, we propose a ...
177
click to vote
IV
2005
IEEE
16 years 9 days ago
2005
IEEE
Transition systems are graphs and it is natural to consider their visual representation as a graph visualization problem. They also pose an interesting multidimensional visualizat...
174
click to vote
ICWE
2005
Springer
16 years 6 days ago
2005
Springer
We present in this paper a method to discover the set of webpages contained in a logical website, based on the link structure of the Web graph. Such a method is useful in the conte...
193
click to vote
WADS
2005
Springer
16 years 5 days ago
2005
Springer
Given a forest F = (V, E) and a positive integer D, we consider the problem of finding a minimum number of new edges E such that in the augmented graph H = (V, E∪E ) any pair of...
186
click to vote
WAOA
2004
Springer
16 years 1 days ago
2004
Springer
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...