6740 search results - page 470 / 1348 » An s -Hamiltonian Line Graph Problem |
176
click to vote
DAWAK
2007
Springer
16 years 1 months ago
2007
Springer
In this paper, we deal with the problem of performing what-if analysis for changes that occur in the schema/structure of the data warehouse We abstract software modules, queries, r...
199
click to vote
IBPRIA
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. This paper presents a new approach to the problem of simultaneous location and segmentation of object in images. The main emphasis is done on the information provided by ...
166
click to vote
IAT
2006
IEEE
16 years 27 days ago
2006
IEEE
Unstructured P2P networks can grow in an ad-hoc and give rise to scale-free graphs where most of the nodes form clusters or hubs around few resourceful nodes. This leads to conges...
182
click to vote
SOFSEM
2005
Springer
16 years 9 days ago
2005
Springer
Abstract. Treewidth is a graph parameter with several interesting theoretical and practical applications. This survey reviews algorithmic results on determining the treewidth of a ...
190
click to vote
ESA
2004
Springer
16 years 7 days ago
2004
Springer
Abstract. We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which ca...