1153 search results - page 156 / 231 » Reversing graph transformations |
115
click to vote
SIGMOD
2010
ACM
15 years 7 months ago
2010
ACM
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
121
Voted
ALENEX
2007
15 years 4 months ago
2007
We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This a...
128
Voted
SIGMOD
2005
ACM
16 years 2 months ago
2005
ACM
Advanced database systems face a great challenge raised by the emergence of massive, complex structural data in bioinformatics, chem-informatics, and many other applications. The ...
157
click to vote
SWAT
2010
Springer
15 years 7 months ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
120
click to vote
EUROGRAPHICS
2010
Eurographics
15 years 11 months ago
2010
Eurographics
Interpolating vertex positions among triangle meshes with identical vertex-edge graphs is a fundamental part of many geometric modelling systems. Linear vertex interpolation is ro...