The graph matching problem
From MaRDI portal
Publication:2444585
DOI10.1007/S10044-012-0284-8zbMATH Open1284.68470DBLPjournals/paa/LiviR13OpenAlexW2003627696WikidataQ57921782 ScholiaQ57921782MaRDI QIDQ2444585FDOQ2444585
Authors: Lorenzo Livi, Antonello Rizzi 
Publication date: 10 April 2014
Published in: PAA. Pattern Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10044-012-0284-8
Recommendations
graph edit distancegraph embeddinggraph kernelsinexact graph matchinggraph-based pattern recognition
Pattern recognition, speech recognition (68T10) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Principal component analysis.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Support-vector networks
- Modern multidimensional scaling. Theory and applications.
- Kernels and regularization on graphs.
- Title not available (Why is that?)
- On Information and Sufficiency
- A note on two problems in connexion with graphs
- Complex networks: structure and dynamics
- An introduction to support vector machines and other kernel-based learning methods.
- Modern Multivariate Statistical Techniques
- Title not available (Why is that?)
- Dynamic programming algorithm optimization for spoken word recognition
- Title not available (Why is that?)
- Fuzzy sets
- Nonmetric multidimensional scaling. A numerical method
- Multidimensional scaling.
- Graph kernels
- Maximum likelihood for Gaussians on graphs
- Title not available (Why is that?)
- A distance measure between attributed relational graphs for pattern recognition
- The Dissimilarity Representation for Pattern Recognition
- Title not available (Why is that?)
- Theoretical foundations of the potential function method in pattern recognition learning
- Title not available (Why is that?)
- Matrix mathematics. Theory, facts, and formulas
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A survey of graph edit distance
- Algorithms for the Assignment and Transportation Problems
- A survey on tree edit distance and related problems
- Managing and mining graph data
- Mining Graph Data
- Title not available (Why is that?)
- On graph kernels: hardness results and efficient alternatives.
- Parallelism in random access machines
- Bridging the Gap between Graph Edit Distance and Kernel Machines
- Pattern recognition.
- Self-organizing maps.
- Structure spaces
- Central clustering of attributed graphs
- Complete mining of frequent patterns from graphs: Mining graph data
- Kron Reduction of Graphs With Applications to Electrical Networks
- Inexact graph matching for structural pattern recognition
- A Riemannian approach to graph embedding
- Graph embedding using tree edit-union
- A graph distance metric based on the maximal common subgraph
- Kernels for Structured Data
- Scale-based approach to hierarchical fuzzy clustering.
- Title not available (Why is that?)
- Automatic learning of cost functions for graph edit distance
- A universal interconnection pattern for parallel computers
- Graph-Theoretic Techniques for Web Content Mining
- A note on the derivation of maximal common subgraphs of two directed or undirected graphs
- Distance-based classification with Lipschitz functions
- Image categorization: Graph edit distance \(+\) edge direction histogram
- A unified approach to pattern recognition
- Title not available (Why is that?)
- Learning probabilistic models of tree edit distance
- A graph distance measure for image analysis
- Title not available (Why is that?)
- Fast string kernels using inexact matching for protein sequences
- Graph classification and clustering based on vector space embedding.
- Speeding up graph edit distance computation through fast bipartite matching
- Graph Embedding Using Quantum Commute Times
- A Quadratic Programming Approach to the Graph Edit Distance Problem
- Characteristic Polynomial Analysis on Matrix Representations of Graphs
- Dimensionality reduction for graph of words embedding
Cited In (43)
- A comparative study of ant colony optimization and reactive search for graph matching problems
- Geometric graphs: matching, similarity and indexing
- Testing correlation of unlabeled random graphs
- On the maximum edge-pair embedding bipartite matching
- The graph association problem: mathematical models and a Lagrangian heuristic
- Recent advance on graph matching in computer vision: from two-graph matching to multi-graph matching
- Graph ambiguity
- A matching algorithm between precursory 3D process model and 2D working procedure drawing based on subgraph isomorphism
- Parameter specification for the degree distribution of simulated Barabási-Albert graphs
- Fifty years of graph matching, network alignment and network comparison
- Inexact graph matching using a hierarchy of matching processes
- Neural software vulnerability analysis using rich intermediate graph representations of programs
- Matching graphs with unique node labels
- Graph-Based Representations in Pattern Recognition
- Title not available (Why is that?)
- Lightning graph matching
- Graph unification and matching
- Correlated randomly growing graphs
- A new measure for the attitude to mobility of Italian students and graduates: a topological data analysis approach
- Efficient random graph matching via degree profiles
- Evolutionary Computation in Combinatorial Optimization
- On the geometry of graph spaces
- Graph-Based Representations in Pattern Recognition
- Spectral graph matching and regularized quadratic relaxations. I: Algorithm and Gaussian analysis
- Nonparametric statistics of dynamic networks with distinguishable nodes
- Statistical graph space analysis
- Connectedness of graphs and its application to connected matroids through covering-based rough sets
- Sequential decision model for inference and prediction on nonuniform hypergraphs with application to knot matching from computational forestry
- Preface of special issue on ``Graph-based processing for pattern recognition
- Interactive graph-matching using active query strategies
- Active-learning query strategies applied to select a graph node given a graph labelling
- Graph matching based on dot product representation of graphs
- The ultimate categorical matching in a graph
- Title not available (Why is that?)
- A long trip in the charming world of graphs for pattern recognition
- Title not available (Why is that?)
- A survey of graph structure descriptions in pattern recognition
- Title not available (Why is that?)
- Modeling the uncertainty of a set of graphs using higher-order fuzzy sets
- Estimation of Monge matrices
- Combinatorial and matrix methods for graph matching
- Matching graphs by pivoting
- Maximum bipartite matchings with low rank data: locality and perturbation analysis
Uses Software
This page was built for publication: The graph matching problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2444585)
