𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time

✍ Scribed by Heggernes, Pinar; van 't Hof, Pim; Lokshtanov, Daniel; Nederlof, Jesper

Book ID
118197956
Publisher
Society for Industrial and Applied Mathematics
Year
2012
Tongue
English
Weight
283 KB
Volume
26
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A linear-time algorithm for computing th
A linear-time algorithm for computing the intersection of all odd cycles in a graph
✍ Leizhen Cai; Baruch Schieber πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 506 KB

We present a linear-time algorithm that finds all edges and vertices in the intersection of all odd cycles in a given graph. We also show an application of our algorithm to a variant of the satisfiability problem of Boolean formulas.

Computing the update of the repeated med
Computing the update of the repeated median regression line in linear time
✍ Thorsten Bernholt; Roland Fried πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 210 KB

The repeated median line estimator is a highly robust method for fitting a regression line to a set of n data points in the plane. In this paper, we consider the problem of updating the estimate after a point is removed from or added to the data set. This problem occurs, e.g., in statistical online