Efficient geometric graph matching using vertex embedding

No abstract is available for this paper.

• Publication year

  2013

• Venue

  SIGSPATIAL/GIS

• Publication date

  2013-11-05

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1145/2525314.2525350
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Towards the unification of structural and statistical pattern recognition

  2012cited by this paper
• Progressive graph matching: Making a move of graphs via probabilistic voting

  2012cited by this paper
• High efficiency and quality: large graphs matching

  2011cited by this paper
• Efficient shortest paths on massive social graphs

  2011cited by this paper
• Armadillo: An Open Source C++ Linear Algebra Library for Fast Prototyping and Computationally Intensive Experiments

  2010cited by this paper
• Exact and Inexact Graph Matching: Methodology and Applications

  2010cited by this paper
• A survey of graph edit distance

  2010cited by this paper
• Reweighted Random Walks for Graph Matching

  2010cited by this paper
• A graph matching method and a graph matching distance based on subgraph assignments

  2010cited by this paper
• Comparing Stars: On Approximating Graph Edit Distance

  2009influential reference
• Approximate graph edit distance computation by means of bipartite graph matching

  2009cited by this paper
• Inexact Matching of Large and Sparse Graphs Using Laplacian Eigenvectors

  2009cited by this paper
• A generative model for graph matching and embedding

  2009cited by this paper
• SERIES IN MACHINE PERCEPTION AND ARTIFICIAL INTELLIGENCE

  2007influential reference
• Prototype selection for dissimilarity-based classifiers

  2006cited by this paper
• Thirty Years Of Graph Matching In Pattern Recognition

  2004cited by this paper
• Graph matching using spectral embedding and alignment

  2004cited by this paper
• Graph Matching using Spectral Embedding and Semidefinite Programming

  2004cited by this paper
• Properties of Embedding Methods for Similarity Searching in Metric Spaces

  2003cited by this paper
• Discovering frequent geometric subgraphs

  2002cited by this paper
• An algorithm for associating the features of two images

  1991cited by this paper
• On a Cyclic String-To-String Correction Problem

  1990cited by this paper
• An Eigendecomposition Approach to Weighted Graph Matching Problems

  1988cited by this paper
• A graph distance measure for image analysis

  1984cited by this paper
• A distance measure between attributed relational graphs for pattern recognition

  1983cited by this paper
• The String-to-String Correction Problem

  1974cited by this paper
• ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE

  1973cited by this paper
• Algorithms for the Assignment and Transportation Problems

  1957influential reference

• Incrementally Detecting Change Types of Spatial Area Object: A Hierarchical Matching Method Considering Change Process

  2018cites this paper
• Geometric Graph Indexing for Similarity Search in Scientific Databases

  2016influential citation
• Geometric graphs: matching, similarity, and indexing

  2015cites this paper
• Geometric graph matching and similarity: a probabilistic approach

  2014cites this paper
• Vertex Similarity - A Basic Framework for Matching Geometric Graphs

  2014cites this paper
• Evaluation of Diagrams Produced by Text-to-Graphic Conversion Systems

  2013cites this paper
• Spectral clustering for divide-and-conquer graph matching

  2013cites this paper