Edge-Partitioning a Graph into Paths: Beyond the Barát-Thomassen Conjecture.

Julien Bensmail Ararat Harutyunyan Tien-Nam Le Stéphan Thomassé

Published in: Comb. (2019)

Keyphrases

graph representation
graph model
disjoint paths
graph partitioning
weighted graph
undirected graph
partitioning algorithm
vertex set
edge information
optimal path
shortest path
directed acyclic graph
edge detection
approximation algorithms
edge detector
edge weights
path length
min cut
directed graph