<--- Back to Details
First PageDocument Content
Graph theory / Graph coloring / NP-complete problems / Graph operations / Perfect graph theorem / Line graph / Perfect graph / Clique / Bipartite graph / Triangle-free graph / Strong perfect graph theorem / Graph minor
Date: 2014-06-05 05:09:32
Graph theory
Graph coloring
NP-complete problems
Graph operations
Perfect graph theorem
Line graph
Perfect graph
Clique
Bipartite graph
Triangle-free graph
Strong perfect graph theorem
Graph minor

WeilSchaudt_DeltaChi_GaC.dvi

Add to Reading List

Source URL: www.zaik.uni-koeln.de

Download Document from Source Website

File Size: 173,96 KB

Share Document on Facebook

Similar Documents

Graph games with perfect information Dietmar Berwanger∗ MPRI

DocID: 1sTXv - View Document

Graph theory / Graph coloring / Independent set / Interval graph / Interval scheduling / Perfect graph / Interval edge coloring

Interval Scheduling to Maximize Bandwidth Provision Mordechai Shalom 1 ∗

DocID: 1rd8U - View Document

Graph theory / Mathematics / Perfect graph / Topological graph theory / Graph / Planar graph / Archimedean graph

C Caallll ffoorr P Paappeerrss Discrete Applied Mathematics Special Issue: Algorithmic and Structural Graph Theory _______________________________________________________

DocID: 1r2Jw - View Document

Computational complexity theory / Graph theory / Mathematics / Phylogenetics / NP-complete problems / Computational phylogenetics / Analysis of algorithms / Probabilistic complexity theory / Randomized algorithm / Steiner tree problem / Algorithm / Maximum parsimony

LNCSFixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction

DocID: 1qRse - View Document