<--- Back to Details
First PageDocument Content
NP-complete problems / Analysis of algorithms / Parameterized complexity / Planar graphs / Graph operations / Bidimensionality / Apex graph / Tree decomposition / Dominating set / Graph theory / Theoretical computer science / Mathematics
Date: 2004-10-18 03:25:13
NP-complete problems
Analysis of algorithms
Parameterized complexity
Planar graphs
Graph operations
Bidimensionality
Apex graph
Tree decomposition
Dominating set
Graph theory
Theoretical computer science
Mathematics

Add to Reading List

Source URL: erikdemaine.org

Download Document from Source Website

File Size: 256,55 KB

Share Document on Facebook

Similar Documents

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

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

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

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

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

DocID: 1rpJU - View Document

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

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

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

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

DocID: 1rg2z - View Document