Solving Hard Graph Problems with Combinatorial Computing and Optimization

Lange, Alexander R

Back to results

Rochester Institute of Technology

Solving Hard Graph Problems with Combinatorial Computing and Optimization

dc:creator Lange, Alexander R

thesis:degree_name Computer Science (MS)

Degree

thesis:*

Name thesis:degree_name: Computer Science (MS)
Level thesis:degree_level: Thesis

Author and committee

dc:creator, dc:contributor.*

Author dc:creator: Lange, Alexander R
Contributors dc:contributor: Stanislaw Radziszowski

Subjects

dc:subject × 6

Combinatorial analysis--Data processing
Graph theory
Folkman numbers
Graph domination
LLL algorithm
Ramsey numbers

Identifiers

dc:identifier.*

Repository record dc:identifier: https://repository.rit.edu/theses/5946
OAI identifier oai:identifier: oai:repository.rit.edu:theses-6950

Chain of custody

source

Harvested from: Rochester Institute of Technology
Base URL: repository.rit.edu/do/oai/
Last updated: 2026-07-27
Source record: OAI-PMH GetRecord

related terms

Combinatorial analysis--Data processing
Graph theory
Folkman numbers
rit
Thesis

citation

Lange, Alexander R. Solving Hard Graph Problems with Combinatorial Computing and Optimization. Thesis thesis, https://repository.rit.edu/theses/5946

Solving Hard Graph Problems with Combinatorial Computing and Optimization

Degree

Author and committee

Subjects

Identifiers

Chain of custody

More from Rochester Institute of Technology