A Simple Algorithm for Computing a Cycle Separator

09/23/2017
by   Sariel Har-Peled, et al.
0

We present a linear time algorithm for computing a cycle separator in a planar graph that is (arguably) simpler than previously known algorithms. Our algorithm builds on, and is somewhat similar to, previous algorithms for computing separators. The main new ingredient is a specific layered decomposition of the planar graph constructed differently from previous BFS-based layerings.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/17/2022

An Optimal Algorithm for Product Structure in Planar Graphs

The Product Structure Theorem for planar graphs (Dujmović et al.JACM, 67...
research
07/18/2018

A Fixed-Parameter Linear-Time Algorithm to Compute Principal Typings of Planar Flow Networks

We present an alternative and simpler method for computing principal typ...
research
11/20/2016

A note about "Faster algorithms for computing Hong's bound on absolute positiveness" by K. Mehlhorn and S. Ray

We show that a linear-time algorithm for computing Hong's bound for posi...
research
07/11/2018

A Fixed-Parameter Linear-Time Algorithm for Maximum Flow in Planar Flow Networks

We pull together previously established graph-theoretical results to pro...
research
02/14/2012

Tightening MRF Relaxations with Planar Subproblems

We describe a new technique for computing lower-bounds on the minimum en...
research
11/15/2018

Computing Quartet Distance is Equivalent to Counting 4-Cycles

The quartet distance is a measure of similarity used to compare two unro...
research
11/21/2020

lospre in linear time

Lifetime-optimal speculative partial redundancy elimination (lospre) is ...

Please sign up or login with your details

Forgot password? Click here to reset