4110 search results - page 351 / 822 » Efficient algorithms for the 2-gathering problem |
175
click to vote
AI
2010
Springer
15 years 6 months ago
2010
Springer
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...
136
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Huffman coding finds an optimal prefix code for a given probability mass function. Consider situations in which one wishes to find an optimal code with the restriction that all cod...
189
click to vote
IJRR
2008
15 years 6 months ago
2008
Automatically building maps from sensor data is a necessary and fundamental skill for mobile robots; as a result, considerable research attention has focused on the technical chall...
196
click to vote
CSCW
2002
ACM
15 years 6 months ago
2002
ACM
Bitmap-based collaborative graphics editing systems are a special class of real-time collaborative editing systems. Undo is an important and difficult problem in these systems. Ex...
181
click to vote
DM
1999
15 years 6 months ago
1999
We examine powers of Hamiltonian paths and cycles as well as Hamiltonian (power) completion problems in several highly structured graph classes. For threshold graphs we give effic...