Handbook of graph theory

By Jonathan L. Gross. Discrete Mathematics and Its Applications, 2007

1,047 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Vision and Pattern Recognition

View Paper: https://www.semanticscholar.org/paper/1f400c9732c13eae95be34a181c2b8042a774a39

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. L. Lehman
2. Ewan Birney
3. Daniel R. Zerbino
4. Adam Martin

In Computer Vision and Pattern Recognition

1. L. Lehman
2. Marie-Josée Fortin
3. Ewan Birney
4. Daniel R. Zerbino
5. Adam Martin

Citations in the corpus

• Velvet: algorithms for de novo short read assembly using de Bruijn graphs. (2008, methodology): “The search itself is based on the Dijkstra algorithm, which has a time complexity of O( N log N ) when implemented with a Fibonacci heap (Gross and Yellen 2004).”
• Connectivity for conservation: a framework to classify network measures. (2011, background): “2b; Gross and Yellen 2004, Diestel 2006; Appendix A).”
• Low-derivative operators of the Standard Model effective field theory via Hilbert series methods (2015, background): “As such, the the number of operators with n fields and m derivatives (minus EOM) is equal to the number of loopless multigraphs with n vertices and m/2 edges [56].”