Applications of Random Methods in Combinatories and Scheduling Problems

Abstract

The Randomized Graph Coloring research aims to provide an efficient randomized algorithm for solving a specific NP-Hard problem, that of graph 3-coloring problem. The simulations are designed to test the practical behavior of the algorithm. Research in graphs and matroids will provide results publishable in top journals in Discrete Mathematics that generalize the existing literature. The objective of the connectivity research is to provide results about longest cycles and contractible edges in graphs and matroids. Such results have applications in combinatorial optimization problems.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 19, 2002
Accession Number
ADA408961

Entities

People

  • Haidong Wu
  • Talmage J. Reid
  • Tristan Denley

Organizations

  • University of Mississippi

Tags

DTIC Thesaurus Topics

  • African Americans
  • Algorithms
  • Combinatorial Analysis
  • Department Of Defense
  • Electronic Mail
  • Evolutionary Algorithms
  • Graph Theory
  • Information Operations
  • Literature
  • Mathematical Programming
  • Mathematics
  • Mississippi
  • Optimization
  • Parallel Computing
  • Parallel Processing
  • Scheduling (Production)
  • Simulations

Readers

  • Graph Algorithms and Convex Optimization.
  • Operations Research
  • Technical Research and Report Writing.