The study assesses the effectiveness of reversible head-only and back-of-the-head electrical stunning of chickens using 130–950 mA per bird at 50 Hz AC

A. Björklund

B. Jackson

D. Karger

G. Chen

H. Whitney

J.E. Hopcroft

T. Feder

T. Ibaraki

English

Gibson, T J

Taylor, A H

Gregory, N G

RVC Research Online

Assessment of the effectiveness of head only and back-of-the-head electrical stunning of chickens

In 1993, Jackson and Wormald conjectured that if G is a 3-connected n-vertex graph with maximum degree d ≥ 4 then G contains a cycle of length Ω(n logd-12), and showed that this bound is best possible if true. In this paper we present an O(n 3) algorithm for finding a cycle of length Ω(n logb2) in G, where b = max{64, 4d + 1}. Our result substantially improves the best existing bound Ω(n log2(d-1)2+12). © Springer-Verlag Berlin Heidelberg 2005.link_to_subscribed_fulltex

Chen, G

Gao, Z

Yu, X

Zang, W

HKU Scholars Hub

Approximating the longest cycle problem on graphs with bounded degree

T. J. Gibson

A. H. Taylor

N. G. Gregory

Crossref

British Poultry Science

Approximating the Longest Cycle Problem on Graphs with Bounded Degree

https://researchonline.rvc.ac.uk/id/eprint/10149/1/10149.pdf

Assessment of the effectiveness of head only and back-of-the-head electrical stunning of chickens

Abstract

Similar works

Full text

Available Versions

RVC Research Online

HKU Scholars Hub

Crossref

Crossref