tree-decomposition相关论文
IN this note all graphs are undirected, finite and simple. For a subgraph H of G, V(H), E(H), ε(H) and μ(H) denote the......
Many difficult (often NP-complete) optimization problems can be solved efficiently on graphs of small tree-width with a ......
Many difficult (often NP-complete) optimization problems can be solved efficiently on graphs of small tree-width with a ......
