Edward J. Farrell

Publication Activity (10 Years)

Years Active: 1962-2016
Publications (10 Years): 1

Top Topics

Computational Complexity

Connected Graphs

Top Venues

Publications

Edward J. Farrell, Andrew A. Hunte
D-Graphs For Graphs With Cyclomatic Number 1. Ars Comb. 129 (2016)
Robert A. Beezer, Edward J. Farrell
The matching polynomial of a regular graph. Discret. Math. 137 (1-3) (1995)
Trond Aukrust, Josef M. Oberhuber, Edward J. Farrell, Peter M. Haugan
A Modeling Study of the North Atlantic with Emphasis on the Greenland-Iceland-Norwegian Sea. IBM Syst. J. 31 (4) (1992)
Edward J. Farrell, J. M. Guo, G. M. Constantine
On matching coefficients. Discret. Math. 89 (2) (1991)
Edward J. Farrell
Preface. IBM J. Res. Dev. 35 (1) (1991)
Edward J. Farrell, Perry A. Appino, Daniel Foty, Thomas D. Linton Jr.
Visual interpretation of multidimensional computations and transistor design. IBM J. Res. Dev. 35 (1) (1991)
Edward J. Farrell
Visual Interpretation of Complex Data. IBM Syst. J. 26 (2) (1987)
Edward J. Farrell, Wen C. Yang, Rosario A. Zappulla
Animated 3D CT Imaging. IEEE Computer Graphics and Applications 5 (12) (1985)
Edward J. Farrell, Steven E. Laux, Philip L. Corson, Edward M. Buturla
Animation and 3D Color Display of Multiple-Variable Data: Application to Semiconductor Design. IBM J. Res. Dev. 29 (3) (1985)
Edward J. Farrell, S. A. Wahid
Matchings in pentagonal chains. Discret. Appl. Math. 8 (1) (1984)
Edward J. Farrell, Rosario A. Zappulla, Wen C. Yang
Color 3-D Imaging of Normal and Pathologic Intracranial Structures. IEEE Computer Graphics and Applications 4 (9) (1984)
Edward J. Farrell, S. A. Wahid
Matchings in benzene chains. Discret. Appl. Math. 7 (1) (1984)
Edward J. Farrell
Forest decompositions of ladders. Discret. Math. 44 (3) (1983)
Edward J. Farrell
Color Display and Interactive Interpretation of Three-Dimensional Data. IBM J. Res. Dev. 27 (4) (1983)
Edward J. Farrell
A note on the circuit polynomials and characteristic polynomials of wheels and ladders. Discret. Math. 39 (1) (1982)
Edward J. Farrell
Cycle decompositions of complete graphs. Discret. Math. 38 (2-3) (1982)
Edward J. Farrell
Defect-d matchings in graphs with cyclomatic numbers 0, 1 and 2. Discret. Math. 33 (3) (1981)
Edward J. Farrell
Chromatic roots - some observations and conjectures. Discret. Math. 29 (2) (1980)
Edward J. Farrell
On chromatic coefficients. Discret. Math. 29 (3) (1980)
Edward J. Farrell
An introduction to matching polynomials. J. Comb. Theory, Ser. B 27 (1) (1979)
Edward J. Farrell
On a general class of graph polynomials. J. Comb. Theory, Ser. B 26 (1) (1979)
Edward J. Farrell
On a class of polynomials obtained from the circuits in a graph and its application to characteristics polynomials of graphs. Discret. Math. 25 (2) (1979)
Edward J. Farrell
On graphical partitions and planarity. Discret. Math. 18 (2) (1977)
Edward J. Farrell
Minimum length matched filters for digital applications (Corresp.). IEEE Trans. Inf. Theory 12 (4) (1966)
Edward J. Farrell
Computer design: Applications of redundancy to improve the accuracy of binary systems. ACM National Conference (1962)