◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

J. Voborník

2 papers hereh-index 235 citations3 works total

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

author position
  • middle author1
  • last author1

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

fields
  • cs.DM1
  • cs.DS1

identity via Semantic Scholar / OpenAlex

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2019

On Polynomial-Time Combinatorial Algorithms for Maximum L-Bounded Flow

Kateřina Altmanová, Petr Kolman, Jan Voborník

Given a graph G=(V,E) with two distinguished vertices s,t∈V and an integer L, an {\em L-bounded flow} is a flow between s and t that can be decomposed into paths of…

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