Keywords: کلاکی عرض; Clique-width; Linear clique-width; Hereditary class;
مقالات ISI کلاکی عرض (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: کلاکی عرض; Even-hole-free graph; Structure theorem; Decomposition; Combinatorial optimization; Coloring; Maximum weight stable set; Treewidth; Clique-width;
Keywords: کلاکی عرض; Well-quasi-ordering; Induced subgraphs; Clique-width; Hereditary classes;
Keywords: کلاکی عرض; Graph algorithm; Alliance; Clique-width; Vertex cover;
Keywords: کلاکی عرض; And/or graphs; W[P]-complete; W[1]-hard; FPT; Tree-width; Clique-width;
Keywords: کلاکی عرض; hereditary graph classes; clique-width;
Keywords: کلاکی عرض; Graph theory; Clique-width; Tree-width; Complexity;
Keywords: کلاکی عرض; Clique-width; Power of a graph; Hereditary graph class; Power-bounded clique-width;
Keywords: کلاکی عرض; Parameterized complexity; Kernelization; Rank-width; Clique-width; Boolean-width; Monadic second-order logic; Modular decomposition
Keywords: کلاکی عرض; Monadic second-order logic; Graph algorithms; Infinite automata; Parameterized algorithms; Tree-width; Clique-width; Dynamic programming; Model-checking; Data complexity; Algorithmic meta-theorems
Keywords: کلاکی عرض; Clique-width; Linear clique-width; Characterisation; Efficient representation
Keywords: کلاکی عرض; Clique-width; Proper interval graphs; Polynomial time; Characterisation; Forbidden induced subgraphs
Keywords: کلاکی عرض; Dominating induced matching; Efficient edge dominating set; Polynomial-time algorithm; Clique-width
Keywords: کلاکی عرض; Digraph; Parameterized complexity; Tree-width; DAG-width; DAG-depth; Clique-width;
Keywords: کلاکی عرض; Clique-width; Bipartite graph; Graph class
Keywords: کلاکی عرض; Clique-width; Proper interval graphs; Linear-time computation; Forbidden induced subgraphs characterisation
On NC algorithms for problems on bounded rank-width graphs
Keywords: کلاکی عرض; Rank-width; NP-complete; Parallel algorithms; Clique-width;
Fly-automata for checking MSO2 graph properties
Keywords: کلاکی عرض; Monadic second-order logic; Edge quantification; Tree-width; Clique-width; Algorithmic meta-theorem; Fly-automaton;
From tree-decompositions to clique-width terms
Keywords: کلاکی عرض; Tree-width; Clique-width; Sparse graph; Planar graph; Incidence graph; Fixed-parameter tractable algorithm;
Rank-width: Algorithmic and structural results
Keywords: کلاکی عرض; Rank-width; Clique-width; NLC-width; Vertex-minor; Boolean-width;
Colouring diamond-free graphs
Keywords: کلاکی عرض; Graph colouring; Diamond-free; Clique-width; Forbidden induced subgraph;
Bounding the clique-width of H-free split graphs
Keywords: کلاکی عرض; Clique-width; Split graph; Perfect graph; Forbidden induced subgraph; Hereditary graph class;
Faster algorithms for vertex partitioning problems parameterized by clique-width
Keywords: کلاکی عرض; Clique-width; Parameterized complexity; Dynamic programming; Generalized domination; Rank-width
Clique-width with an inactive label
Keywords: کلاکی عرض; Clique-width; Linear clique-width; Characterisation; Forbidden induced subgraphs; Distance-hereditary graphs
Critical properties of graphs of bounded clique-width
Keywords: کلاکی عرض; Clique-width; Hereditary class of graphs
HH-product of graphs, HH-threshold graphs and threshold-width of graphs
Keywords: کلاکی عرض; Graph decomposition; Canonical decomposition; Threshold-width; Clique-width; NLC-width; HH-threshold graphs; Threshold graphs; Difference graphs; Bipartite chain graphs; Finite list of forbidden induced subgraphs
The complexity of finding uniform sparsest cuts in various graph classes
Keywords: کلاکی عرض; Sparsest cut; Parameterized complexity; Treewidth; Clique-width; Unit interval graph
Colouring vertices of triangle-free graphs without forests
Keywords: کلاکی عرض; Vertex colouring; Triangle-free graphs; Polynomial-time algorithm; Clique-width
Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
Keywords: کلاکی عرض; Clique-width; Characterization via forbidden induced subgraphs; Special graph classes
On the model-checking of monadic second-order formulas with edge set quantifications
Keywords: کلاکی عرض; Tree-width; Clique-width; Monadic second-order logic; Graph decomposition; Model-checking
Automata for the verification of monadic second-order graph properties
Keywords: کلاکی عرض; Graph algorithm; Automaton; Monadic second-order logic; Clique-width; Fixed-parameter tractability; Fly-automaton
On the OBDD size for graphs of bounded tree- and clique-width
Keywords: کلاکی عرض; Decision diagram; Ordered binary decision diagram; Tree-width; Clique-width; Cograph
The NLC-width and clique-width for powers of graphs of bounded tree-width
Keywords: کلاکی عرض; Tree powers; Leaf powers; Steiner powers; Tree-width; Clique-width; NLC-width
Graph operations characterizing rank-width
Keywords: کلاکی عرض; Clique-width; Rank-width; Hierarchical decomposition; Graph operation
Recent developments on graphs of bounded clique-width
Keywords: کلاکی عرض; Clique-width; Tree-width; Rank-width; Hereditary class
Clique-width of graphs defined by one-vertex extensions
Keywords: کلاکی عرض; Graph classes; Vertex extension; Cographs; Distance-hereditary graphs; Clique-width
Solving some NP-complete problems using split decomposition
Keywords: کلاکی عرض; Graph algorithms; Graph coloring; NP-complete problems; Split decomposition; Clique-width
Counting truth assignments of formulas of bounded tree-width or clique-width
Keywords: کلاکی عرض; Satisfiability (SAT); Counting problems; Fixed parameter tractable (FPT); Tree-width; Clique-width
A local characterization of bounded clique-width for line graphs
Keywords: کلاکی عرض; Clique-width; NLC-width; Line graphs; Co-gem-free line graphs
On powers of graphs of bounded NLC-width (clique-width)
Keywords: کلاکی عرض; Clique-width; NLC-width; Coloring; Power graph; Polynomial
Vertex-minor reductions can simulate edge contractions
Keywords: کلاکی عرض; Clique-width; Rank-width; Tree-width; Tree-decomposition; Local complementation; Edge contraction; Vertex-minor
Line graphs of bounded clique-width
Keywords: کلاکی عرض; Clique-width; NLC-width; Line graphs; Incidence graphs; Tree-width
Characterizations for co-graphs defined by restricted NLC-width or clique-width operations
Keywords: کلاکی عرض; NLC-width; NLCT-width; Linear NLC-width; Trivially perfect; Threshold graphs; Co-graphs; Clique-width
The monadic second-order logic of graphs XV: On a conjecture by D. Seese
Keywords: کلاکی عرض; Graph; Clique-width; Comparability graph; Line graph; Interval graph; Monadic second-order logic; Decidable theory; Monadic second-order transduction
Chordal co-gem-free and (P5,gem)-free graphs have bounded clique-width
Keywords: کلاکی عرض; Chordal co-gem-free graphs; Modules and homogeneous sets in graphs; Clique-width; (P5; gem)-free graphs;
On the relationship between NLC-width and linear NLC-width
Keywords: کلاکی عرض; NLC-width; NLCT-width; Linear NLC-width; Clique-width; Linear clique-width;
Rank-width and vertex-minors
Keywords: کلاکی عرض; Clique-width; Rank-width; Vertex-minor; Local complementation; Pivoting; Branch-width; Binary matroid;