Optimization on products of combinatorial structures

We consider optimization problems on combinatorial structures with a product form. The independence number of a graph G, denoted α (G), is the size of the largest independent set in G, where a subset S of the vertex set V(G) is independent if no two vertices in S are adjacent in G. The clique covering number of G, denoted $\Theta (G)$, is the minimum number of complete subgraphs required to cover the vertices of G.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Mathematics

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2011

Author dc:creator

• Chappell, Glenn G.

Contributors dc:contributor

• West, Douglas B.

• Mathematics

Statement dc:rights

• Copyright 1996 Chappell, Glenn G.

Language dc:language

eng

Identifier

9780591197617
AAI9712220
(UMI)AAI9712220

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/22881