scientific article; zbMATH DE number 2222791

MaRDI QIDQ5701586zbMATH OpenFDO

Authors Christophe Irniger

Publication date 4 November 2005

zbMATH Keywords

database filtersdatabases of graphsinput graphs

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Structural, Syntactic, and Statistical Pattern Recognition
• Graph-Based Representations in Pattern Recognition
• scientific article; zbMATH DE number 2043360
• scientific article; zbMATH DE number 1759528
• 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
• scientific article; zbMATH DE number 2043360 (Why is no real title available?)
• scientific article; zbMATH DE number 1759528 (Why is no real title available?)
• Entanglement entropy in the spinless free fermion model and its application to the graph isomorphism problem
• Geometric graphs: matching, similarity and indexing
• Graph-Based Representations in Pattern Recognition
• Structural, Syntactic, and Statistical Pattern Recognition
• 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)