<--- Back to Details
First PageDocument Content
Chordal graph / Planar graphs / Tree decomposition / Neighbourhood / Clique / Vertex separator / Dominating set / Tree / K-tree / Graph theory / Graph operations / Triangulation
Date: 2006-01-10 19:15:56
Chordal graph
Planar graphs
Tree decomposition
Neighbourhood
Clique
Vertex separator
Dominating set
Tree
K-tree
Graph theory
Graph operations
Triangulation

Add to Reading List

Source URL: www.aaai.org

Download Document from Source Website

File Size: 1.005,75 KB

Share Document on Facebook

Similar Documents

Brief Announcement: Local Approximability of Minimum Dominating Set on Planar Graphs Miikka Hilke Christoph Lenzen

DocID: 1tR7l - View Document

Minimum Dominating Set Approximation in Graphs of Bounded Arboricity Christoph Lenzen and Roger Wattenhofer Computer Engineering and Networks Laboratory (TIK) ETH Zurich {lenzen,wattenhofer}@tik.ee.ethz.ch

DocID: 1s1V7 - View Document

Graph theory / Mathematics / NP-complete problems / Network theory / Networks / Combinatorial optimization / Semantic similarity / Line graph / Centrality / Matching / Dominating set / Graph partition

A Fresh Look on Knowledge Bases: Distilling Named Events from News Erdal Kuzey Jilles Vreeken

DocID: 1rpJU - View Document

Graph theory / NP-complete problems / Graph coloring / Dominating set / Graph / Chordal graph / Pathwidth / Trapezoid graph

New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs∗ Archontia C. Giannopoulou and George B. Mertzios School of Engineering and Computing Sciences, Durham University, UK archont

DocID: 1rlxP - View Document

Graph theory / NP-complete problems / Graph operations / Line graph / Cograph / Clique / Neighbourhood / Matching / Hypergraph / Independent set / Graph / Dominating set

Finding Four-Node Subgraphs in Triangle Time Virginia Vassilevska Williams∗ Joshua R. Wang† Abstract

DocID: 1rg2z - View Document