Keywords: نمودار غیر متمرکز; Drive-response systems; Distributed control; Fixed-time synchronization; Nonlinear protocol; Undirected graph;
مقالات ISI نمودار غیر متمرکز (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: نمودار غیر متمرکز; Distributed control; Finite-time tracking; Flexible spacecraft; Under-actuated; Undirected graph;
Keywords: نمودار غیر متمرکز; Minimum weight connected dominating set; Hybrid genetic algorithm; Population-based iterated greedy algorithm; Optimization heuristics; Undirected graph;
Keywords: نمودار غیر متمرکز; Character grouping; Undirected graph; Graphic processing; The properties of the nodes; The weights of the edges; Topographic map
Keywords: نمودار غیر متمرکز; Indeterminate string; Regular string; Prefix array; Prefix table; Feasible array; Undirected graph; Minimum alphabet size; Lexicographical order
Keywords: نمودار غیر متمرکز; Reliability; Minimal cut; Second order; Undirected graph; Minimal cycle
Keywords: نمودار غیر متمرکز; 60J10; 15A18; Undirected graph; Markov chain; Random walk; Second largest eigenvalue;
Keywords: نمودار غیر متمرکز; 05C72; 05C57; 68R10; 94A99; Linear guessing number; Undirected graph; Network coding;
Keywords: نمودار غیر متمرکز; Hydrocarbon; Undirected graph; Matching; Delta-matroid; Matroid; Group action; Classification;
Keywords: نمودار غیر متمرکز; Conditional independence; Faithfulness; Multivariate totally positive of order two distribution; Undirected graph;
The number of connected components in a graph associated with a rectangular (0,1)(0,1)-matrix
Keywords: نمودار غیر متمرکز; 05C40; 05B20; 15A18; 15A24Chainable matrix; Connected component; Undirected graph; Incidence matrix; Adjacency matrix; Tensor product
A shortest cycle for each vertex of a graph
Keywords: نمودار غیر متمرکز; Graph algorithms; Girth; Shortest path; Undirected graph
On the sizes of graphs and their powers: The undirected case
Keywords: نمودار غیر متمرکز; Graph theory; Undirected graph; Diameter; Power of a graph; Transitive closure of a graph; Edge number; Size of a graph; Identifying code; Hamiltonian graph
Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs
Keywords: نمودار غیر متمرکز; Graph algorithm; Greedy algorithm; Undirected graph; Location problem; Vertex-connectivity;
Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs
Keywords: نمودار غیر متمرکز; Undirected graph; Connectivity augmentation problem; Monotone requirement; Polynomial time deterministic algorithm
The source location problem with local 3-vertex-connectivity requirements
Keywords: نمودار غیر متمرکز; Undirected graph; Source location problem; Local vertex-connectivity; Deficient set
Augmenting forests to meet odd diameter requirements
Keywords: نمودار غیر متمرکز; Undirected graph; Graph augmentation problem; Diameter; Forest; Approximation algorithm
Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs
Keywords: نمودار غیر متمرکز; Undirected graph; Connectivity augmentation problem; Local edge-connectivity; Node-to-area connectivity; Polynomial time deterministic algorithm
The edge-orientation problem and some of its variants on weighted graphs
Keywords: نمودار غیر متمرکز; Undirected graph; Directed graph; Edge-orientation problem; Trees; NP-hard; Special graphs
Properties of optimal survivable paths in a graph
Keywords: نمودار غیر متمرکز; Undirected graph; Shortest paths; Survivability; Routing optimization; Diverse routing; Multicommodity flow; Optical network;
The symmetric N-matrix completion problem
Keywords: نمودار غیر متمرکز; Partial matrix; Completion problem; N-matrix; Undirected graph;