Degree Reduction in Labeled Graph Retrieval

DOI10.1145/2699878zbMath1347.68356OpenAlexW1969731136MaRDI QIDQ2828204

Julian R. Ullmann

Publication date: 24 October 2016

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2699878

zbMATH Keywords

degree reductionconstraint satisfactionsubgraph isomorphismdomain reductiongraph indexingnetwork alignmentgraph retrievalsubgraph similarity

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• STR2: optimized simple tabular reduction for table constraints
• A survey of graph edit distance
• AllDifferent-based filtering for subgraph isomorphism
• Relational consistency algorithms and their application in finding subgraph and graph isomorphisms
• Evaluation of RDF queries via equivalence
• Emergence of Scaling in Random Networks
• A Sufficient Condition for Backtrack-Free Search
• Subset Methods for Recognizing Distorted Patterns
• Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism

This page was built for publication: Degree Reduction in Labeled Graph Retrieval