6740 search results - page 482 / 1348 » An s -Hamiltonian Line Graph Problem |
149
click to vote
WWW
2009
ACM
16 years 7 months ago
2009
ACM
This paper identifies and explores the problem of seed selection in a web-scale crawler. We argue that seed selection is not a trivial but very important problem. Selecting proper...
149
click to vote
IJCAI
2001
15 years 8 months ago
2001
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
194
click to vote
SIAMDM
2008
15 years 6 months ago
2008
The power system monitoring problem asks for as few as possible measurement devices to be put in an electric power system. The problem has a graph theory model involving power dom...
177
click to vote
COMBINATORICS
2000
15 years 6 months ago
2000
In this paper we consider the problem of establishing a value r0 such that almost all random graphs with n vertices and rn edges, r > r0, are asymptotically not 3-colorable. In...
173
click to vote
RR
2010
Springer
15 years 5 months ago
2010
Springer
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination on RDF graphs in the presence of rules (in the form of Datalog r...