scientific article; zbMATH DE number 2222791
From MaRDI portal
Publication:5701586
Recommendations
- Decision tree structures for graph database filtering
- Decision trees for error-tolerant graph database filtering
- Theoretical analysis and experimental comparison of graph matching algorithms for database filtering
- Graph matching: Fast candidate elimination using machine learning techniques
- A large database of graphs and its use for benchmarking graph isomorphism algorithms
Cited in
(20)- Video indexing and similarity retrieval by largest common subgraph detection using decision trees
- Filtering graphs to check isomorphism and extracting mapping by using the conductance electrical model
- The graph matching problem
- Degree reduction in labeled graph retrieval
- Information-geometric graph indexing from bags of partial node coverages
- Efficient Graph Kernels for Textual Entailment Recognition
- A similarity search technique for graph set
- Investigation graph isomorphism problem via entanglement entropy in strongly regular graphs
- Q-trees -- efficient retrieval of graphs by means of structure invariants.
- A novel approach for detection and elimination of automorphic graphs in graph databases
- Efficient Suboptimal Graph Isomorphism
- Theoretical analysis and experimental comparison of graph matching algorithms for database filtering
- Graph matching: Fast candidate elimination using machine learning techniques
- Entanglement entropy in the spinless free fermion model and its application to the graph isomorphism problem
- Geometric graphs: matching, similarity and indexing
- Decision trees for error-tolerant graph database filtering
- Decision tree structures for graph database filtering
- Entanglement entropy in the ground state of supersymmetric fermion lattice models
- Matching graphs with unique node labels
- SQBC: an efficient subgraph matching method over large and dense graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5701586)