Keywords: تجزیه درخت; Tree-decomposition; Treewidth; NP-hard;
مقالات ISI تجزیه درخت (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: تجزیه درخت; Tree-decomposition; Branch-decomposition; Linked; Lean; Separation system;
Keywords: تجزیه درخت; Minimally rigid graphs; Laman graphs; Henneberg sequences; Geometric constraint solving; Geometric constraint graphs; Tree-decomposition;
Keywords: تجزیه درخت; Induced subgraph; Colouring; Tree-decomposition
Keywords: تجزیه درخت; Multicommodity flows; Tree-decomposition; Polynomial-time
An excluded minors method for infinite matroids
Keywords: تجزیه درخت; Matroid; Infinite Matroid; Tree-decomposition; Representable; Rota's Conjecture; Minor; Tutte-decomposition; Thin sums; Ends;
A proof of the Barát-Thomassen conjecture
Keywords: تجزیه درخت; Tree-decomposition; Large edge-connectivity; Barát-Thomassen conjecture;
Canonical tree-decompositions of a graph that display its k-blocks
Keywords: تجزیه درخت; Graph; Connectivity; Tree-decomposition; k-Block; Tangle; Profile;
Canonical tree-decompositions of finite graphs II. Essential parts
Keywords: تجزیه درخت; Graph; Minor; Tangle; k-block; Tree-decomposition
Canonical tree-decompositions of finite graphs I. Existence and algorithms
Keywords: تجزیه درخت; Graph; Connectivity; Tree-decomposition; k-block; Tangle; Profile; Tutte-decomposition
The structure of 2-separations of infinite matroids
Keywords: تجزیه درخت; Infinite; Matroid; Tree-decomposition; Tutte; Cunningham; Edmonds; Seymour; 2-separation; 3-connected
Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
Keywords: تجزیه درخت; Cutting and packing; Bin packing with conflicts; Tree-decomposition; Heuristics; Tabu search
New lower bounds for bin packing problems with conflicts
Keywords: تجزیه درخت; Bin packing with conflicts; Knapsack problem; Lower bounds; Chordal graphs; Tree-decomposition; Dual-feasible functions
Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm
Keywords: تجزیه درخت; Dynamic programming; Tree-decomposition; Branch-decomposition; Path-decomposition; Dominating set
Tree-decompositions with bags of small diameter
Keywords: تجزیه درخت; Tree-decomposition; Tree-width; Tree-length; Chordality; Small separator
Vertex-minor reductions can simulate edge contractions
Keywords: تجزیه درخت; Clique-width; Rank-width; Tree-width; Tree-decomposition; Local complementation; Edge contraction; Vertex-minor
On compact and efficient routing in certain graph classes
Keywords: تجزیه درخت; Message routing; Localized distributed algorithms; Tree-decomposition; Acyclic clustering; Chordal bipartite graphs; Homogeneously orderable graphs
Edge-maximal graphs of branchwidth k
Keywords: تجزیه درخت; Graph; Tree-decomposition; Width parameters;
Graph decompositions for cartesian products
Keywords: تجزیه درخت; Tree-decomposition; path-decomposition; algorithmic complexity; graph grammars; graph logic;