Implementing discrete mathematics: combinatorics and graph theory with Mathematica
Implementing discrete mathematics: combinatorics and graph theory with Mathematica
Graphs: theory and algorithms
Graph theory and its applications
Graph theory and its applications
The Mathematica Book
Extending Neural Networks for B-Spline Surface Reconstruction
ICCS '02 Proceedings of the International Conference on Computational Science-Part II
Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematica ®
Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematica ®
Future Generation Computer Systems - Special issue: Geocomputation
Functional networks for B-spline surface reconstruction
Future Generation Computer Systems - Special issue: Computer graphics and geometric modeling
On advance reservation of heterogeneous network paths
Future Generation Computer Systems - Special issue: High-speed networks and services for data-intensive grids: The DataTAG project
Dynamic paths in multi-domain optical networks for grids
Future Generation Computer Systems - Special issue: High-speed networks and services for data-intensive grids: The DataTAG project
P2P contracts: a framework for resource and service exchange
Future Generation Computer Systems - Special issue: P2P computing and interaction with grids
Authenticity and availability in PIPE networks
Future Generation Computer Systems - Special issue: P2P computing and interaction with grids
Very large Bayesian multinets for text classification
Future Generation Computer Systems
Neural networks for event extraction from time series: a back propagation algorithm approach
Future Generation Computer Systems
Learning methods for radial basis function networks
Future Generation Computer Systems
User hints: a framework for interactive optimization
Future Generation Computer Systems
Looking for narrow interfaces in automatic differentiation using graph drawing
Future Generation Computer Systems
| Hi-index | 0.00 |
This paper analyzes some graph issues by using the symbolic program Mathematica and its version for the Web, webMathematica. In particular, we consider the problem of graph coloring: the assignment of colors to the vertices/edges of the graph such that adjacent vertices/edges are colored differently. In addition, we address the problem of obtaining the tenacity of binomial trees with Mathematica. Finally, we describe briefly an example of the application of our software to a scheduling problem.