<--- Back to Details
First PageDocument Content
Graph coloring / Line graph / Perfect graph / Chordal graph / Hypohamiltonian graph / Hamiltonian path / Independent set / Comparability graph / Induced path / Graph theory / NP-complete problems / Graph operations
Date: 2007-07-06 14:03:11
Graph coloring
Line graph
Perfect graph
Chordal graph
Hypohamiltonian graph
Hamiltonian path
Independent set
Comparability graph
Induced path
Graph theory
NP-complete problems
Graph operations

Add to Reading List

Source URL: cgm.cs.mcgill.ca

Download Document from Source Website

File Size: 548,90 KB

Share Document on Facebook

Similar Documents

Probabilistic Path Hamiltonian Monte Carlo Vu Dinh * 1 Arman Bilge * 1 2 Cheng Zhang * 1 Frederick A. Matsen IV 1 Abstract Hamiltonian Monte Carlo (HMC) is an efficient and effective means of sampling posterior distribut

Probabilistic Path Hamiltonian Monte Carlo Vu Dinh * 1 Arman Bilge * 1 2 Cheng Zhang * 1 Frederick A. Matsen IV 1 Abstract Hamiltonian Monte Carlo (HMC) is an efficient and effective means of sampling posterior distribut

DocID: 1uGjC - View Document

How Euler Did It by Ed Sandifer Knight’s Tour April 2006 It is sometimes difficult to imagine that Euler had a social life, but it is not surprising that he could find mathematics in what other people did for fun. He b

How Euler Did It by Ed Sandifer Knight’s Tour April 2006 It is sometimes difficult to imagine that Euler had a social life, but it is not surprising that he could find mathematics in what other people did for fun. He b

DocID: 1rkKa - View Document

How to apply de Bruijn graphs to genome assembly

How to apply de Bruijn graphs to genome assembly

DocID: 1rgGj - View Document

ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti

ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti

DocID: 1rauh - View Document

Bachelor / Master Thesis  Hamilton cycles in Kneser graphs Description. The Kneser graph K(n, k) has as vertices all k-element subsets of an n-element set, where any two disjoint sets are connected by an edge. Note that

Bachelor / Master Thesis Hamilton cycles in Kneser graphs Description. The Kneser graph K(n, k) has as vertices all k-element subsets of an n-element set, where any two disjoint sets are connected by an edge. Note that

DocID: 1r5gC - View Document