406 search results - page 52 / 82 » Dominating Sets in Web Graphs |
CIKM
2009
Springer
14 years 29 days ago
2009
Springer
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
ATAL
2007
Springer
14 years 3 months ago
2007
Springer
In many settings Web services are now perceived as the first choice technology to provide neatly encapsulated functionality for Web-based computation. To date, many standards hav...
WEBI
2005
Springer
14 years 2 months ago
2005
Springer
Several algorithms based on link analysis have been developed to measure the importance of nodes on a graph such as pages on the World Wide Web. PageRank and HITS are the most pop...
ECAI
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. Typical ontology matching applications, such as ontology integration, focus on the computation of correspondences holding between the nodes of two graph-like structures, ...
CIE
2007
Springer
14 years 3 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....