Login / Signup
Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear Time.
David Eppstein
Bruce Reed
Published in:
CoRR (2018)
Keyphrases
</>
planar graphs
maximum likelihood
knapsack problem
weighted graph