Sciweavers

248 search results - page 33 / 50
» New Approximation Algorithms for Minimum Cycle Bases of Grap...
Sort
View
NPAR
2010
ACM
14 years 23 days ago
Stylized depiction of images based on depth perception
Recent works in image editing are opening up new possibilities to manipulate and enhance input images. Within this context, we leverage well-known characteristics of human percept...
Jorge Lopez-Moreno, Jorge Jimenez, Sunil Hadap, Er...
ICALP
2009
Springer
14 years 8 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
CCS
2009
ACM
14 years 8 months ago
The union-split algorithm and cluster-based anonymization of social networks
Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...
Brian Thompson, Danfeng Yao
WAOA
2005
Springer
112views Algorithms» more  WAOA 2005»
14 years 1 months ago
Partial Multicuts in Trees
Let T = (V, E) be an undirected tree, in which each edge is associated with a non-negative cost, and let {s1, t1}, . . . , {sk, tk} be a collection of k distinct pairs of vertices...
Asaf Levin, Danny Segev
EDBT
2009
ACM
132views Database» more  EDBT 2009»
14 years 2 months ago
A novel approach for efficient supergraph query processing on graph databases
In recent years, large amount of data modeled by graphs, namely graph data, have been collected in various domains. Efficiently processing queries on graph databases has attracted...
Shuo Zhang, Jianzhong Li, Hong Gao, Zhaonian Zou