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

Q: What does this research mean for the field?

The minimum 3-cut for a planar graph can be found in $O(|V|^2)$ time using the proposed algorithm. Novelty: ClaimNovelty.METHODOLOGICAL. Consensus alignment: ConsensusAlignment.NEUTRAL.

Dorit S. Hochbaum; David B. Shmoys

doi:10.1137/0606068

October 1, 1985SIAM Journal on Algebraic and Discrete Methods

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

View at Publisher

Ask AI

Bookmark

Share

Ask about this paper

Answers are grounded in this paper and cite their sources.

Abstract

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.

Discussion

No takes yet. Share an insight, caveat, or question.

Cite This Study

Hochbaum et al. (1985) studied this question.

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

View at Publisher

Ask AI

Bookmark

Share

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

Ask about this paper

Abstract

Discussion

Cite This Study

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

Ask about this paper

Abstract

Discussion

Cite This Study

Keep reading

Keep reading