Pulse nav.journalClub Tendencias Explorar Preguntas Investigadores

Download the App

Join discussions, follow papers, and never miss your next session.

© Synapse Social LLC, 2026Política de privacidad

Inicio Explorar nav.journalClub Tendencias

⌘+K

An O (| V |²) Algorithm for the Planar 3-Cut Problem | Synapse

October 1, 1985

An O (| V |²) Algorithm for the Planar 3-Cut Problem

Puntos clave

Los puntos clave no están disponibles para este artículo en este momento.

Resumen

A 3-cut for a connected graph G is a set of edges which, when deleted, separate G into 3 components. In this paper we present an O (| V |²) algorithm to find the minimum 3-cut for a planar graph G.

Me gusta

Guardar

Compartir

Me gusta

Guardar

Compartir

Cite This Study

Hochbaum et al. (Tue,) studied this question.

synapsesocial.com/papers/6a0f6010d13714ec96fe1947 https://doi.org/https://doi.org/10.1137/0606068