<--- Back to Details
First PageDocument Content
Graph operations / Chordal graph / Interval graph / Perfect graph / Intersection graph / Matching / Planar graph / Neighbourhood / Path decomposition / Graph theory / Clique problem / Clique
Date: 2007-10-30 11:31:52
Graph operations
Chordal graph
Interval graph
Perfect graph
Intersection graph
Matching
Planar graph
Neighbourhood
Path decomposition
Graph theory
Clique problem
Clique

Add to Reading List

Source URL: www-pr.informatik.uni-tuebingen.de

Download Document from Source Website

File Size: 285,07 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