◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

V. A. Buslov

2 papers hereh-index 593 citations22 works total

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

author position
  • sole author1
  • first author1

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

fields
  • cs.DM1
  • math.CO1

identity via Semantic Scholar / OpenAlex

most citedOn the Minimum Spanning Tree for Directed Graphs with Potential Weights

2 citations · 2 across the 2 of their papers we have counts for

collaborators
Showing math.COShow all

1 paper · 1 filter

math.CO2025

Splitting a graph by a given partition of the set of vertices based on the minimum weight of the induced trees

V. A. Buslov

A method for considering a weighted directed graph with an accuracy of up to a given partition of the set of vertices is proposed. The resulting digraph (the splitting graph) does…

◍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.