Keywords: جوانان گراف; Graph immersion; Graph minors;
مقالات ISI جوانان گراف (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: جوانان گراف; Phylogenetics; Triangulations; Treewidth; Graph minors;
Keywords: جوانان گراف; Theta graphs; Graph minors;
Keywords: جوانان گراف; Random graphs; Graph minors; Logical limit laws;
Keywords: جوانان گراف; Graph minors; Extremal function; Cycles; Average degree;
Keywords: جوانان گراف; Graph Minors; Treewidth; Disjoint Paths Problem;
Keywords: جوانان گراف; Graph minors; Tree-depth; Vertex ranking
Keywords: جوانان گراف; Tree-width; Graph minors
Keywords: جوانان گراف; Square roots of graphs; Branch-width; Carving-width; Graph minors;
Partitioning H-minor free graphs into three subgraphs with no large components
Keywords: جوانان گراف; Vertex partitions; Graph minors; Odd minors; Small components;
Forbidden directed minors and Kelly-width
Keywords: جوانان گراف; Forbidden minors; Graph minors; Kelly-width; Partial k-DAGs; Treewidth;
Recent techniques and results on the ErdÅs-Pósa property
Keywords: جوانان گراف; ErdÅs-Pósa property; min-max theorems; Tree decompositions; Tree partitions; Girth; Graph minors; Topological minors; Graph immersions;
The complexity of two graph orientation problems
Keywords: جوانان گراف; Graph orientation; Diameter; Planar graph; Graph minors; Apex graph;
Kernels for acyclic digraphs
Keywords: جوانان گراف; Pattern recognition; Directed graph; Graph similarity; Graph kernel; Graph minors; Path and cycle in graphs
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
Keywords: جوانان گراف; Parameterized complexity; Planar graphs; Subexponential algorithm; Branch decomposition; Graph minors; Bidimensionality; Catalan structures
Many disjoint dense subgraphs versus large kk-connected subgraphs in large graphs with given edge density
Keywords: جوانان گراف; Graph minors; Edge density; Connected subgraphs
On Ks,tKs,t-minors in graphs with given average degree
Keywords: جوانان گراف; Graph minors; Average degree; Complete bipartite graphs
Covering planar graphs with forests
Keywords: جوانان گراف; 05C70; Trees; Forests; Planar graphs; Outerplanar graphs; Hamiltonian cycles; Series parallel graphs; Graph minors;
Graph minor hierarchies
Keywords: جوانان گراف; Graph minors; Hierarchy; Decomposition; Tree-width; Grid-width;
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
Keywords: جوانان گراف; Parameterized complexity; Graph minors; FPT algorithms;