Applying Mathematica and webMathematica to graph coloring
Loading...
Date
2007
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier
Open Access Color
BRONZE
Green Open Access
Yes
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
BIP! Indicators
Impulse
Average
Influence
Average
Popularity
Average
Abstract
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. © 2006 Elsevier Ltd. All rights reserved. © 2008 Elsevier B.V. All rights reserved.
Description
Keywords
Chromatic Number, Edge Coloring, Graph Coloring, Mathematica, Vertex Coloring, Coloring, Computer Science, Computer Software, Mathematical Programming, Problem Solving, Binomial Trees, Graph Coloring, Mathematica (software), Scheduling Problem, Symbolic Program, Graph Theory, Coloring, Computer science, Computer software, Mathematical programming, Problem solving, Binomial trees, Graph coloring, Mathematica (software), Scheduling problem, Symbolic program, Graph theory, Chromatic Number, Graph Coloring, Edge Coloring, Vertex Coloring, Mathematica, Graph theory, Graph colorings, Chromatic number, Mathematica, Vertex coloring, Edge coloring
Fields of Science
0102 computer and information sciences, 0101 mathematics, 01 natural sciences
Citation
WoS Q
Scopus Q
OpenCitations Citation Count
1
Source
Future Generation Computer Systems
Volume
23
Issue
5
Start Page
716
End Page
720
PlumX Metrics
Citations
Scopus : 2
Captures
Mendeley Readers : 12
Google Scholar™
