Results 151 to 160 of about 24,879 (166)

Clique-colourings characterizing Hamming graphs

1997
Summary: Hamming graphs are characterized by means of suitable clique-colourings.
openaire   +3 more sources

Hamming Graphs and Hanoi Graphs

2008
openaire   +1 more source

A (sub)graph isomorphism algorithm for matching large graphs

IEEE Transactions on Pattern Analysis and Machine Intelligence, 2004
Pasquale Foggia, Mario Sansone, Mario Vento   +2 more
exaly  

The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains

IEEE Signal Processing Magazine, 2013
Antonio Ortega
exaly  

Constructing knowledge graphs and their biomedical applications

Computational and Structural Biotechnology Journal, 2020
David N Nicholson, Casey S. Greene
exaly  

Bipolar fuzzy graphs

Information Sciences, 2011
Muhammad Akram
exaly  

Green’s function approach for quantum graphs: An overview

Physics Reports, 2016
Fabiano M Andrade
exaly  

An median graphs: properties, algorithms, and applications

IEEE Transactions on Pattern Analysis and Machine Intelligence, 2001
Xiaoyi Jiang
exaly  

Bipolar fuzzy graphs with applications

Knowledge-Based Systems, 2013
Muhammad Akram
exaly  

A Review of Relational Machine Learning for Knowledge Graphs

Proceedings of the IEEE, 2016
Volker Tresp, Evgeniy Gabrilovich
exaly