1952 search results - page 105 / 391 » Complete partitions of graphs |
127
click to vote
DEXA
2004
Springer
15 years 9 months ago
2004
Springer
: In this paper, we will propose PC-Filter (PC stands for Partition Comparison), a robust data filter for approximately duplicate record detection in large databases. PC-Filter dis...
202
click to vote
SDM
2011
SIAM
14 years 7 months ago
2011
SIAM
While the social and information networks have become ubiquitous, the challenge of collecting complete network data still persists. Many times the collected network data is incomp...
145
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
The Steiner tree problem is a classical NP-hard optimization problem with a wide range of practical applications. In an instance of this problem, we are given an undirected graph ...
135
click to vote
AI
2007
Springer
15 years 4 months ago
2007
Springer
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
147
click to vote
JGAA
2008
15 years 4 months ago
2008
Bar k-visibility graphs are graphs admitting a representation in which the vertices correspond to horizontal line segments, called bars, and the edges correspond to vertical lines...