<--- Back to Details
First PageDocument Content
NP-complete problems / Vertex cover / Tree decomposition / Graph / Voltage graph / Dominating set / Graph theory / Theoretical computer science / Mathematics
Date: 2013-06-22 19:48:39
NP-complete problems
Vertex cover
Tree decomposition
Graph
Voltage graph
Dominating set
Graph theory
Theoretical computer science
Mathematics

Tractable Parameterizations for the Minimum Linear Arrangement Problem Michael R. Fellows1 , Danny Hermelin2 , Frances Rosamond1 , and Hadas Shachnai3 1

Add to Reading List

Source URL: www.cs.technion.ac.il

Download Document from Source Website

File Size: 516,81 KB

Share Document on Facebook

Similar Documents