activity
20232025
most citedExact Algorithms and Lowerbounds for Multiagent Pathfinding: Power of Treelike Topology

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

collaborators
Showing math.COShow all

1 paper · 1 filter

math.CO2025

Density of Traceable Graphs

Michal Dvořák, Dušan Knop, Michal Opler +3

We establish tight lower and upper bounds on the number of edges in traceable graphs in several classes of dense graphs. A graph is traceable if it has a Hamiltonian path. We show…