<--- Back to Details
First PageDocument Content
Tree decomposition / Clique / Graph / Path decomposition / Split graph / Graph theory / Chordal graph / Graph operations
Date: 2009-10-30 06:03:52
Tree decomposition
Clique
Graph
Path decomposition
Split graph
Graph theory
Chordal graph
Graph operations

Graph decomposition Identifying chordal graphs Junction trees

Add to Reading List

Source URL: www.stats.ox.ac.uk

Download Document from Source Website

File Size: 221,49 KB

Share Document on Facebook

Similar Documents

Graph theory / Bipartite graphs / Graph operations / NP-complete problems / Chordal bipartite graph / Chordal graph / Distance-hereditary graph / Matching / Line graph / Split graph / Graph / Cycle

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

DocID: 1rf09 - View Document

Graph theory / Graph operations / NP-complete problems / Chordal graph / Clique / Graph minor / Edge contraction / Tree decomposition / Vertex / Split graph / Graph / Independent set

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

Graph theory / NP-complete problems / Circular-arc graph / Hamiltonian path / Intersection graph / Graph / Path / Interval graph / Chordal graph / Indifference graph / Longest path problem / Split graph

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

DocID: 1qr87 - View Document

Clique-width / Graph theory / Split graph / Graph coloring / Journal of Graph Theory / Discrete mathematics / Planar graph

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

DocID: 1pBY8 - View Document

Network flow / Combinatorial optimization / Flow network / Operations research / Maximum flow problem / Cut / FordFulkerson algorithm / Minimum cut / Shortest path problem / Planar graph / Split / Topology

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