Login / Signup

A polynomial-time algorithm for Outerplanar Diameter Improvement.

Nathann CohenDaniel GonçalvesEun Jung KimChristophe PaulIgnasi SauDimitrios M. ThilikosMathias Weller
Published in: J. Comput. Syst. Sci. (2017)
Keyphrases
  • computational complexity
  • worst case
  • graph isomorphism
  • social networks
  • matching algorithm
  • approximation algorithms
  • planar graphs