Results 211 to 218 of about 9,952 (218)
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2021
Graph isomorphisms are adjacency and label (equivalence class) preserving one-to-one correspondences between vertex sets of possibly labelled graphs. The graph isomorphism problem is then the task of deciding whether two given graphs are isomorphic or not and basis of complexity class GI, containing all problems with polynomial reduction to former ...
openaire +1 more source
Graph isomorphisms are adjacency and label (equivalence class) preserving one-to-one correspondences between vertex sets of possibly labelled graphs. The graph isomorphism problem is then the task of deciding whether two given graphs are isomorphic or not and basis of complexity class GI, containing all problems with polynomial reduction to former ...
openaire +1 more source
HRNCE grammars — a hypergraph generating system with an eNCE way of rewriting
, 1999 Changwook Kim, Tae Eui Jeong
openalex +1 more source
A study on rewriting p systems splicing grammar systems and picture array languages
, 2007 S. Hemalatha
openalex