<--- Back to Details
First PageDocument Content
Graph theory / NP-complete problems / Clique / Independent set / Split graph / Neighbourhood / Bipartite graph / Degree / Vertex / Graph / Line graph / Chordal graph
Date: 2015-05-03 06:37:17
Graph theory
NP-complete problems
Clique
Independent set
Split graph
Neighbourhood
Bipartite graph
Degree
Vertex
Graph
Line graph
Chordal graph

Add to Reading List

Source URL: fpt.akt.tu-berlin.de

Download Document from Source Website

File Size: 326,68 KB

Share Document on Facebook

Similar Documents

On factorial properties of chordal bipartite graphs Konrad Dabrowski∗ Vadim V. Lozin†  Victor Zamaraev‡

On factorial properties of chordal bipartite graphs Konrad Dabrowski∗ Vadim V. Lozin† Victor Zamaraev‡

DocID: 1rf09 - View Document

Contracting a chordal graph to a split graph or a tree? Petr A. Golovach1 , Marcin Kami´ nski2 , and 1 Dani¨el Paulusma

Contracting a chordal graph to a split graph or a tree? Petr A. Golovach1 , Marcin Kami´ nski2 , and 1 Dani¨el Paulusma

DocID: 1qMoS - View Document

Discrete Applied Mathematics–399  Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam

Discrete Applied Mathematics–399 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam

DocID: 1qr87 - View Document

Marcin Jakub Kaminski ´ Université Libre de Bruxelles Département d’Informatique Bvd. du Triomphe, CPBruxelles

Marcin Jakub Kaminski ´ Université Libre de Bruxelles Département d’Informatique Bvd. du Triomphe, CPBruxelles

DocID: 1pBY8 - View Document

In IEEE Transactions on PAMI, Vol. 26, No. 9, pp, Septp.1 An Experimental Comparison of Min-Cut/Max-Flow Algorithms for

In IEEE Transactions on PAMI, Vol. 26, No. 9, pp, Septp.1 An Experimental Comparison of Min-Cut/Max-Flow Algorithms for

DocID: 1paZS - View Document