Computational Discrete Mathematics: Algorithmic Graph Theory

By S. Pemmaraju, Steven S. Skiena. 2003

364 citations recorded by the source corpus.

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

View Paper: https://www.semanticscholar.org/paper/d22b5e502389a840a47fd5c6a4fae829e1d8bb8c

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. Louis H. Rowen
2. Zur Izhakian
3. James J. Brannick
4. David M Levinson
5. Ludmil T. Zikatanov
6. Feng Xie
7. Manfred Knebusch
8. Marianne Akian

In Computer Vision and Pattern Recognition

1. David M Levinson
2. Feng Xie
3. Zur Izhakian
4. Louis H. Rowen
5. L. Beauguitte
6. Cesar Ducruet

Citations in the corpus

• The Tropical Rank of a Tropical Matrix (2006, methodology): “We use [3] as a general reference for graphs.”
• Measuring the Structure of Road Networks (2007, methodology): “In order to further define the connection types in such a network, the concepts 9 of “bridge” (or “cut edge”) and “articulation points” are also introduced according to Gibbons (1985).”
• Algebraic Multigrid Methods Based on Compatible Relaxation and Energy Minimization (2007, background): “An important observation (see, for example, [Gib85]) related to the sparsity of A is that (Affei, ej) = 0 holds for all k, i, and j such that 1 ≤ k < |i− j|G.”
• Supertropical matrix algebra (2008, methodology): “We use [7] as a general reference for graphs.”