Exploiting graph structure to cope with hard problems

Martin Golumbic; Andreas Brandstädt; Pinar   Heggernes; Ross   McConnell

Exploiting graph structure to cope with hard problems

Martin Golumbic (Editor), Andreas Brandstädt (Editor), Pinar Heggernes (Editor), Ross McConnell (Editor)

Department of Computer Science

Research output: Book/Report › Report › peer-review

Abstract

This report documents the program and the outcomes of Dagstuhl Seminar 11182 “Exploiting graph structure to cope with hard problems” which has been held in Schloss Dagstuhl – Leibniz Center for Informatics from May 1st, 2011 to May 6th, 2011. During the seminar experts with a common focus on graph algorithms presented various new results in how to attack NP-hard graph problems by using the structure of the input graph. Moreover, in the afternoon of each seminar’s day new problems have been posed and discussed.

Original language	English
Publisher	Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Number of pages	29
State	Published - 2011

Cite this

@book{b98e5e38d09f4c7b9682e3786ccf127b,

title = "Exploiting graph structure to cope with hard problems",

abstract = "This report documents the program and the outcomes of Dagstuhl Seminar 11182 “Exploiting graph structure to cope with hard problems” which has been held in Schloss Dagstuhl – Leibniz Center for Informatics from May 1st, 2011 to May 6th, 2011. During the seminar experts with a common focus on graph algorithms presented various new results in how to attack NP-hard graph problems by using the structure of the input graph. Moreover, in the afternoon of each seminar{\textquoteright}s day new problems have been posed and discussed.",

editor = "Martin Golumbic and Andreas Brandst{\"a}dt and Pinar Heggernes and Ross McConnell",

year = "2011",

language = "English",

publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

address = "Germany",

}

TY - BOOK

T1 - Exploiting graph structure to cope with hard problems

A2 - Golumbic, Martin

A2 - Brandstädt, Andreas

A2 - Heggernes, Pinar

A2 - McConnell, Ross

PY - 2011

Y1 - 2011

N2 - This report documents the program and the outcomes of Dagstuhl Seminar 11182 “Exploiting graph structure to cope with hard problems” which has been held in Schloss Dagstuhl – Leibniz Center for Informatics from May 1st, 2011 to May 6th, 2011. During the seminar experts with a common focus on graph algorithms presented various new results in how to attack NP-hard graph problems by using the structure of the input graph. Moreover, in the afternoon of each seminar’s day new problems have been posed and discussed.

AB - This report documents the program and the outcomes of Dagstuhl Seminar 11182 “Exploiting graph structure to cope with hard problems” which has been held in Schloss Dagstuhl – Leibniz Center for Informatics from May 1st, 2011 to May 6th, 2011. During the seminar experts with a common focus on graph algorithms presented various new results in how to attack NP-hard graph problems by using the structure of the input graph. Moreover, in the afternoon of each seminar’s day new problems have been posed and discussed.

M3 - Report

BT - Exploiting graph structure to cope with hard problems

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

ER -

Exploiting graph structure to cope with hard problems

Abstract

Fingerprint

Cite this