Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Heiko Dörr
Bypass Strong V-Structures and Find an Isomorphic Labelled Subgraph in Linear Time
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Related publications
Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems
Intersection of Isomorphic Linear Codes
Journal of Combinatorial Theory - Series A
Combinatorics
Computational Theory
Discrete Mathematics
Theoretical Computer Science
Mathematics
Searching Protein 3-D Structures in Linear Time
Journal of Computational Biology
Genetics
Molecular Biology
Computational Theory
Simulation
Computational Mathematics
Mathematics
Modeling
Minimally Strong Subgraph (K,l)-Arc-Connected Digraphs
Discussiones Mathematicae - Graph Theory
Combinatorics
Applied Mathematics
Discrete Mathematics
Lie Groups Simply Isomorphic With No Linear Group
Bulletin of the American Mathematical Society
To Find a Non-Split Strong Dominating Set of an Interval Graph Using an Algorithm
IOSR Journal of Mathematics
Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem
SIAM Journal on Optimization
Theoretical Computer Science
Software
An Integer Linear Program for Substitution-Tolerant Subgraph Isomorphism and Its Use for Symbol Spotting in Technical Drawings
Pattern Recognition
Signal Processing
Computer Vision
Pattern Recognition
Artificial Intelligence
Software
Figure 3: Subgraph Split Procedure Takes an Initial Semantic Subgraph (Q) and Produces Two Smaller Semantic Subgraphs (D1andD2) Using All Vertices (V) From (Q).
