Gary Haggard
Bucknell University
10 Papers
32 Citations
Gary Haggard is an academic researcher from Bucknell University. The author has contributed to research in topics: Chromatic polynomial & Tutte polynomial. The author has an hindex of 4, co-authored 10 publications.
Chat about Author
Papers
The computation of chromatic polynomials
Gary Haggard,Thomas R. Mathies +1 more
TL;DR: The computation of the chromatic polynomial of this graph is computed by enhancing the algorithm based on the classical Delete-Contract theorem as well as finding approaches for substantially modifying a computation tree during computation.
7
Graph works - pilot graph theory visualization tool
Dan Medani,Gary Haggard,Chris Bassett,Peter Koch,Nikolas Lampert,Tim Medlock,Steven Pierce,Ryan Smith,Andrew Yehl +8 more
- 25 Oct 2010
TL;DR: Graph Works is a visualization tool to show what properties of graph mean in terms of a particular graph and what properties and substructures fundamental theorems guarantee to exist in a graph.
6
•Proceedings Article
Improving Mutual Understanding of Development Artifacts: A Semiotics-Based Approach
Jennifer Ferreira,Robert E. Crossler,Gary Haggard +2 more
- 01 Jan 2007
TL;DR: A new project management tool to measure and ensure common understanding of development artifacts is presented, based on Peirce's theory of semiotics and Mayer’s theory of learning.
5
•Proceedings Article
Edge-selection heuristics for computing Tutte polynomials
David J. Pearce,Gary Haggard,Gordon F. Royle +2 more
- 01 Jan 2009
TL;DR: In this paper, two edge selection heuristics for computing the Tutte polynomial of a graph are presented and compared with a range of other heuristic algorithms, and experimental data comparing their effectiveness.
•Journal Article
Edge-Selection Heuristics for Computing Tutte Polynomials.
TL;DR: This paper presents and discusses two edge-selection heuristics which (respectively) give good performance on sparse and dense graphs and develops the most efficient algorithm to-date for computing the Tutte polynomial of a graph.
4