Oleg Verbitsky

Graph Learning · 2010–2015

A researcher in the Science corpus: 2 papers; trusts 5 researchers and is trusted by 2 researchers here, as inferred from the citation graph.

Subfields

Whom Oleg Verbitsky trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

  1. László Babai
  2. Jin-Yi Cai
  3. Eugene M. Luks

Who trusts Oleg Verbitsky overall

  1. B. Douglas

Papers from Oleg Verbitsky's perspective

Ordered by how strongly the researchers Oleg Verbitsky trusts endorse each paper. Same corpus, a different order for every researcher.

  1. Random Graph Isomorphism
  2. Canonical labeling of graphs
  3. An optimal lower bound on the number of variables for graph identification
  4. Graphs on Surfaces (Johns Hopkins series in the mathematical sciences)
  5. Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs
  6. Automorphism groups, isomorphism, reconstruction
  7. Graph isomorphism problem
  8. Isomorphism of graphs of bounded valence can be tested in polynomial time
  9. On construction and identification of graphs
  10. The graph isomorphism disease

Their papers