4009 search results - page 395 / 802 » Clustering on Complex Graphs |
189
click to vote
ICIAP
1999
ACM
15 years 11 months ago
1999
ACM
ÐThis paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matchi...
211
click to vote
SPAA
1993
ACM
15 years 11 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
176
click to vote
ENC
2004
IEEE
15 years 10 months ago
2004
IEEE
Point hierarchies are suitable for creating framecoherent animations of 3D models in non-photorealistic styles such as stippling, painterly and other artistic rendering. In this p...
164
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
Duplicate detection determines different representations of realworld objects in a database. Recent research has considered the use of relationships among object representations t...
175
Voted
JCT
2007
15 years 6 months ago
2007
Abstract. We develop linear representation theory for bicircular matroids, a chief example being a matroid associated with forests of a graph, and bicircular lift matroids, a chief...