Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2019

Highly Cited

2019

Graph Neural Networks (GNNs) are an effective framework for representation learning of graphs. GNNs follow a neighborhood… Expand

Is this relevant?

Highly Cited

2016

Highly Cited

2016

We show that the Graph Isomorphism (GI) problem and the more general problems of String Isomorphism (SI) andCoset Intersection… Expand

Is this relevant?

Highly Cited

2015

Highly Cited

2015

We show that the Graph Isomorphism (GI) problem and the related problems of String Isomorphism (under group action) (SI) and… Expand

Is this relevant?

Highly Cited

2003

Highly Cited

2003

Introduction to Graphs Fundamentals of Graph Theory, Jonathan L. Gross and Jay Yellen Families of Graphs and Digraphs, Lowell W… Expand

Is this relevant?

Highly Cited

1987

Highly Cited

1987

Given a graph X, define the presentation PX to have generators the vertices of X, and a relation xy = yx for each pair x, y of… Expand

Is this relevant?

Highly Cited

1986

Highly Cited

1986

In this paper we introduce a new tool for controlling the knowledge transfer process in cryptographic protocol design. It is… Expand

Is this relevant?

Highly Cited

1981

Highly Cited

1981

The GRAPH ISOMORPHISM problem has so far resisted attempts at determining its complexity status—it has not been shown to be NP… Expand

Is this relevant?

Highly Cited

1980

Highly Cited

1980

A straightforward linear time canonical labeling algorithm is shown to apply to almost all graphs (i.e. all but $o(2^{( \begin… Expand

Is this relevant?

Highly Cited

1979

Highly Cited

1979

A graph is an interval graph tf and only if each of Its verttces can be associated with an interval on the real hne m such a way… Expand

Is this relevant?

Highly Cited

1976

Highly Cited

1976

Subgraph isomorphism can be determined by means of a brute-force tree-search enumeration procedure. In this paper a new algorithm… Expand

Is this relevant?