Login / Signup
Covering 3-uniform hypergraphs by vertex-disjoint tight paths.
Jie Han
Published in:
J. Graph Theory (2022)
Keyphrases
</>
lower bound
upper bound
shortest path
pairwise
worst case
directed graph
graph theory
genetic algorithm
information systems
artificial neural networks
multiple paths