Bypass Strong V-Structures and Find an Isomorphic Labelled Subgraph in Linear Time

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-59071-4_57
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems

English

Intersection of Isomorphic Linear Codes

Journal of Combinatorial Theory - Series A
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
1997English

Searching Protein 3-D Structures in Linear Time

Journal of Computational Biology
GeneticsMolecular BiologyComputational TheorySimulationComputational MathematicsMathematicsModeling
2010English

Minimally Strong Subgraph (K,l)-Arc-Connected Digraphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2020English

Lie Groups Simply Isomorphic With No Linear Group

Bulletin of the American Mathematical Society
1936English

To Find a Non-Split Strong Dominating Set of an Interval Graph Using an Algorithm

IOSR Journal of Mathematics
2013English

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 ScienceSoftware
2019English

An Integer Linear Program for Substitution-Tolerant Subgraph Isomorphism and Its Use for Symbol Spotting in Technical Drawings

Pattern Recognition
Signal ProcessingComputer VisionPattern RecognitionArtificial IntelligenceSoftware
2012English

Figure 3: Subgraph Split Procedure Takes an Initial Semantic Subgraph (Q) and Produces Two Smaller Semantic Subgraphs (D1andD2) Using All Vertices (V) From (Q).

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy