<--- Back to Details
First PageDocument Content
Order theory / Intersection graph / Greedy coloring / Graph / Chordal graph / Tree / Interval graph / Graph operations / Split graph / Graph theory / Graph coloring / Comparability graph
Date: 2011-11-28 08:32:39
Order theory
Intersection graph
Greedy coloring
Graph
Chordal graph
Tree
Interval graph
Graph operations
Split graph
Graph theory
Graph coloring
Comparability graph

Add to Reading List

Source URL: people.math.gatech.edu

Download Document from Source Website

File Size: 756,40 KB

Share Document on Facebook

Similar Documents

Computational complexity theory / Theory of computation / Mathematics / Complexity classes / Analysis of algorithms / Graph coloring / Theoretical computer science / Algorithm / NP / Time complexity / Greedy algorithm / P

fea-mcgeoch.qxp:58 AM

DocID: 1qeWP - View Document

Graph coloring / Telecommunications / Network theory / Fiber-optic communications / Routing and wavelength assignment / Mathematical optimization / Greedy algorithm / Wavelength-division multiplexing / Optical fiber / Mathematics / Theoretical computer science / Graph theory

Mathematics-in-Industry Case Studies Journal, Volume 1, ppWavelength Assignment in Optical Network Design Brendan Farrell ∗

DocID: 19Cyg - View Document

Network theory / Complex network / Connectivity / Graph / Social networks / Edge coloring / Greedy coloring / Graph theory / Mathematics / Graph coloring

REPORTS An Experimental Study of the Coloring Problem on Human Subject Networks Michael Kearns,* Siddharth Suri, Nick Montfort Theoretical work suggests that structural properties of naturally occurring networks are imp

DocID: 18J6M - View Document

Theoretical computer science / Interval tree / Delaunay triangulation / Edge coloring / Greedy coloring / Graph theory / Graph coloring / Mathematics

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Fault-Tolerant Conflict-Free Colorings Mohammad Ali Abam∗ 1

DocID: 1889D - View Document

NP-complete problems / Parameterized complexity / Kernelization / Vertex cover / Graph coloring / Minimum k-cut / Algorithm / Independent set / Greedy algorithm / Theoretical computer science / Mathematics / Computational complexity theory

Greedy Localization, Iterative Compression and Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting and a Novel 2k Kernelization for Vertex Cover Frank Dehne1 , Mike Fellows2 , Frances Ro

DocID: 17SAF - View Document