◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

A. Prolubnikov

9 papers hereh-index 217 citations15 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author7
  • last author2

Across the 9 of 9 papers where every author was matched, so the position is known.

fields
  • cs.DM2
  • cs.DS2
  • cs.CC1
  • math.CO1
  • math.GM1
  • math.NA1

identity via Semantic Scholar / OpenAlex

activity
20022026
most citedHeuristic algorithm for solving of the graph isomorphism problem

1 citations · 3 across the 8 of their papers we have counts for

collaborators
Showing 2023 · cs.DMShow all

1 paper · 2 filters

cs.DM2023

Finding the connected components of the graph using perturbations of the adjacency matrix

Alexander Prolubnikov

The problem of finding the connected components of a graph is considered. The algorithms addressed to solve the problem are used to solve such problems on graphs as problems of fin…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.