Sciweavers

Share
ICDAR
2009
IEEE
9 years 3 months ago
Symbol Detection Using Region Adjacency Graphs and Integer Linear Programming
In this paper, we tackle the problem of localizing graphical symbols on complex technical document images by using an original approach to solve the subgraph isomorphism problem. ...
Pierre Le Bodic, Hervé Locteau, Séba...
PVLDB
2010
129views more  PVLDB 2010»
9 years 4 months ago
iGraph: A Framework for Comparisons of Disk-Based Graph Indexing Techniques
Graphs are of growing importance in modeling complex structures such as chemical compounds, proteins, images, and program dependence. Given a query graph Q, the subgraph isomorphi...
Wook-Shin Han, Jinsoo Lee, Minh-Duc Pham, Jeffrey ...
CORR
1999
Springer
145views Education» more  CORR 1999»
9 years 5 months ago
Subgraph Isomorphism in Planar Graphs and Related Problems
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
David Eppstein
JCB
2007
118views more  JCB 2007»
9 years 5 months ago
Discovering Topological Motifs Using a Compact Notation
Discovering topological motifs or common topologies in one or more graphs is an important as well as an interesting problem. It had been classically viewed as the subgraph isomorp...
Laxmi Parida
JUCS
2008
123views more  JUCS 2008»
9 years 5 months ago
Instruction Scheduling Based on Subgraph Isomorphism for a High Performance Computer Processor
: This paper1 presents an instruction scheduling algorithm based on the Subgraph Isomorphism Problem. Given a Directed Acyclic Graph (DAG) G1, our algorithm looks for a subgraph G2...
Ricardo Santos, Rodolfo Azevedo, Guido Araujo
AI
2010
Springer
9 years 6 months ago
AllDifferent-based filtering for subgraph isomorphism
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...
Christine Solnon
CP
2007
Springer
10 years 1 days ago
Filtering for Subgraph Isomorphism
A subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a ļ¬ltering algorithm dedicated to this...
Stéphane Zampelli, Yves Deville, Christine ...
books