Partitioning edges of a planar graph into linear forests and a matching.

Marthe Bonamy Jadwiga Czyzewska Lukasz Kowalik Michal Pilipczuk

Published in: CoRR (2023)

Keyphrases

planar graphs
undirected graph
weighted graph
spanning tree
matching algorithm
upper bound
maximum likelihood
feature points
edge detector