Approximating the chromatic number of an arbitrary graph using a supergraph heuristic - Info and Reading Options
By Loren G. Eggen
"Approximating the chromatic number of an arbitrary graph using a supergraph heuristic" was published by Naval Postgraduate School in 1997 - Monterey, Calif, it has 57 pages and the language of the book is English.
“Approximating the chromatic number of an arbitrary graph using a supergraph heuristic” Metadata:
- Title: ➤ Approximating the chromatic number of an arbitrary graph using a supergraph heuristic
- Author: Loren G. Eggen
- Language: English
- Number of Pages: 57
- Publisher: Naval Postgraduate School
- Publish Date: 1997
- Publish Location: Monterey, Calif
“Approximating the chromatic number of an arbitrary graph using a supergraph heuristic” Subjects and Themes:
- Subjects: GRAPHS - HEURISTIC METHODS
Edition Specifications:
- Pagination: xviii, 57 p. ;
Edition Identifiers:
- The Open Library ID: OL25295358M - OL16613155W
AI-generated Review of “Approximating the chromatic number of an arbitrary graph using a supergraph heuristic”:
"Approximating the chromatic number of an arbitrary graph using a supergraph heuristic" Description:
The Open Library:
We color the vertices of a graph G, so that no two adjacent vertices have the same color. We would like to do this as cheaply as possible. An efficient coloring would be very helpful in optimization models, with applications to bin packing, examination timetable construction, and resource allocations, among others. Graph coloring with the minimum number of colors is in general an NP-complete problem. However, there are several classes of graphs for which coloring is a polynomial-time problem. One such class is the chordal graphs. This thesis deals with an experimental algorithm to approximate the chromatic number of an input graph G. We first find a maximal edge-induced chordal subgraph H of G. We then use a completion procedure to add edges to H, so that the chordality is maintained, until the missing edges from G are restored to create a chordal supergraph S. The supergraph S can then be colored using the greedy approach in polynomial time. The graph G now inherits the coloring of the supergraph S.
Read “Approximating the chromatic number of an arbitrary graph using a supergraph heuristic”:
Read “Approximating the chromatic number of an arbitrary graph using a supergraph heuristic” by choosing from the options below.
Search for “Approximating the chromatic number of an arbitrary graph using a supergraph heuristic” downloads:
Visit our Downloads Search page to see if downloads are available.
Borrow "Approximating the chromatic number of an arbitrary graph using a supergraph heuristic" Online:
Check on the availability of online borrowing. Please note that online borrowing has copyright-based limitations and that the quality of ebooks may vary.
- Is Online Borrowing Available: Yes
- Preview Status: full
- Check if available: The Open Library & The Internet Archive
Find “Approximating the chromatic number of an arbitrary graph using a supergraph heuristic” in Libraries Near You:
Read or borrow “Approximating the chromatic number of an arbitrary graph using a supergraph heuristic” from your local library.
- The WorldCat Libraries Catalog: Find a copy of “Approximating the chromatic number of an arbitrary graph using a supergraph heuristic” at a library near you.
Buy “Approximating the chromatic number of an arbitrary graph using a supergraph heuristic” online:
Shop for “Approximating the chromatic number of an arbitrary graph using a supergraph heuristic” on popular online marketplaces.
- Ebay: New and used books.