๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A linear-time algorithm for computing the intersection of all odd cycles in a graph

โœ Scribed by Leizhen Cai; Baruch Schieber

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
506 KB
Volume
73
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

โœฆ Synopsis

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.

๐Ÿ“œ SIMILAR VOLUMES

A linear time algorithm for computing th
A linear time algorithm for computing the most reliable source on a series-parallel graph with unreliable edges
โœ Charles J. Colbourn; Guoliang Xue ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 993 KB

Given a network with n vertices and m edges where each edge has an independent operational probability, we are interested in finding a vertex of the network whose expected number of reachable vertices is maximum. Such a vertex is called a most reliable source of the network. This problem was studied

A fast algorithm for the computation of
A fast algorithm for the computation of the plasma concentration time curve and confidence limits in linear pharmacokinetics
โœ P.J.A. Lago ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 531 KB

An algorithm is developed for the computation of the plasma concentration time curve for a drug administration regime involving fast injection (bolus) and/or continuous infusion. The effect of the pharmacokinetic model parameter variations on the plasma concentration time curve is analyzed and effic