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

Computing the Girth of a Planar Graph in Linear Time

โœ Scribed by Chang, Hsien-Chih; Lu, Hsueh-I

Book ID
120434985
Publisher
Society for Industrial and Applied Mathematics
Year
2013
Tongue
English
Weight
431 KB
Volume
42
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

[Lecture Notes in Computer Science] Comp
[Lecture Notes in Computer Science] Computing and Combinatorics Volume 6842 || Computing the Girth of a Planar Graph in Linear Time
โœ Fu, Bin; Du, Ding-Zhu ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Springer Berlin Heidelberg ๐ŸŒ English โš– 246 KB

This book constitutes the refereed proceedings of the 17th Annual International Conference on Computing and Combinatorics, held in Dallas, TX, USA, in August 2011. The 54 revised full papers presented were carefully reviewed and selected from 136 submissions. Topics covered are algorithms and data s

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.