Sciweavers

128 search results - page 22 / 26
» Isomorphic Subgraphs
Sort
View
WG
1999
Springer
13 years 11 months ago
Finding Smallest Supertrees Under Minor Containment
The diversity of application areas relying on tree-structured data results in wide interest in algorithms which determine differences or similarities among trees. One way of meas...
Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thi...
APIN
2006
109views more  APIN 2006»
13 years 7 months ago
Visual analogy: Viewing analogical retrieval and mapping as constraint satisfaction problems
The core issue of analogical reasoning is the transfer of relational knowledge from a source case to a target problem. Visual analogical reasoning pertains to problems containing ...
Patrick W. Yaner, Ashok K. Goel
ECCC
2006
70views more  ECCC 2006»
13 years 7 months ago
Finding a Heaviest Triangle is not Harder than Matrix Multiplication
We show that for any > 0, a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n + n2+), where is the ...
Artur Czumaj, Andrzej Lingas
PVLDB
2010
129views more  PVLDB 2010»
13 years 5 months ago
Graph Pattern Matching: From Intractable to Polynomial Time
Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often to...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Ying...
PKDD
2010
Springer
194views Data Mining» more  PKDD 2010»
13 years 5 months ago
Weighted Symbols-Based Edit Distance for String-Structured Image Classification
As an alternative to vector representations, a recent trend in image classification suggests to integrate additional structural information in the description of images in order to...
Cécile Barat, Christophe Ducottet, É...