1 search results - page 1 / 1 » Hardness of computing width parameters based on branch decom... |
DAM
2010
13 years 5 months ago
2010
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...