iTrans.ir
سفارش ترجمه
خانه
راهنما
چگونه سفارش ترجمه دهیم
تماس با ما
ترجمه فوری
راهنمای استفاده از سایت
API
بیشتر...
پرسش و پاسخ
قیمت ترجمه
ثبت نام
ورود
021-66989400
021-66989500
0935-173-0404
نشانی و اطلاعات تماس
تگ vertex
جزئیات خدمات ترجمه در ترجمه تخصصی
صفحه 17 تا 22 - آذر
On Dominator Colorings in Graphs
Computers & Operations Research 59 (2015) 78–93
Next-Generation Tax Provision Software:
Next-Generation Tax Provision Software:
Description of properties of words such that meeting the selectional
Journal of Combinatorial Theory, Series B 110 (2015) 47–66
BULLETIN OF THE POLISH ACADEMY OF SCIENCES
k-A NONYMITY AGGARWAL, FEDER, KENTHAPADI, MOTWANI, PANIGRAHY, THOMAS, ZHU
Downloaded by http://iranpaper.ir ﺏﺎﺘﮐ ﻭ ﻪﻟﺎﻘﻣ ﻥﺎﮕﯾﺍﺭ ﺩﻮﻠﻧﺍﺩ ﻪﻧﺎﻣﺎﺳ
Int. J. Appl. Comput. Math (2015) 1:503–511
Predictive partitioning for efficient BFS
Chapter 3
Combinatorial Model and Bounds for Target Set Selection
CanadianMathematicalBulletin
Remarks on Dynamic Monopolies with Given Average Thresholds
∗
420 Hakan Hac~gumug, Bijit Hore, Bala Iyer, and Sharad Mehrotra
Nosql
66 S. Burckhardt et al.
Matching Structure and Semantics:
BetweennessCentralityonGPUsandHeterogeneous
it is often necessary to make the pins of several
it is often necessary to make the pins of several
Applied Mathematics and Computation 294 (2017) 299–309
Applied Mathematics and Computation 294 (2017) 299–309
Applied Mathematics and Computation 294 (2017) 299–309
Linear Algebra and its Applications 519 (2017) 136–145
1
Graph-based Ranking Algorithms for Sentence Extraction,
Graph-based Ranking Algorithms for Sentence Extraction,
Parallel Computing 60 (2016) 1–21
Graph-based Ranking Algorithms for Sentence Extraction,
Graph-based Ranking Algorithms for Sentence Extraction,
1
BuR -- Business Research
BuR -- Business Research
The k-center problem
The k-center problem
CUSTOM
CUSTOM
CUSTOM
CUSTOM
Object space versus world space Every object in Maya has
Object space versus world space Every object in Maya has
576 Chapter 8 GRAPH THEORY
Information Processing Letters 86 (2003) 191–196
Information Processing Letters 86 (2003) 191–196
Information Processing Letters 86 (2003) 191–196
Information Processing Letters 86 (2003) 191–196
Available online at www.sciencedirect.com
1. Introduction
vertex cover problem
vertex cover problem
Available online at
