Network Resources for Colouring a Graph
Edit Page
Report
Scan day: 09 February 2014 UTC
23
Virus safety - good
Description: Resources for formulating and solving coloring problems.
Network Resources for Coloring a Graph Network Resources for Coloring a Graph by: Michael Trick ([email protected]) Given an undirected graph, a clique of the graph is a set of mutually adjacent vertices. A maximum clique is, naturally, a clique whose number of vertices is at least as large as that for any other clique in the graph. If the vertices have weights then a maximum weighted clique is a clique with the largest possible sum of vertex weights.
Size: 451 chars
Contact Information
Email: —
Phone&Fax: —
Address: —
Extended: —
WEBSITE Info
| Page title: | Network Resources for Coloring a Graph |
| Keywords: | |
| Description: | |
| IP-address: | 128.2.90.56 |
WHOIS Info
| NS | Name Servers: NSAUTH1.NET.CMU.EDU 128.2.1.8 NSAUTH2.NET.CMU.EDU 128.237.148.168 |
| WHOIS | |
| Date | activated: 24-Apr-1985 last updated: 16-Sep-2010 expires: 31-Jul-2014 |