Íàïèñàòü ðåôåðàòû, êóðñîâûå è äèïëîìû ñàìîñòîÿòåëüíî. Àíòèïëàãèàò.
Ñòóäåíòî÷êà.ru: íà ãëàâíóþ ñòðàíèöó. Íàïèñàòü ñàìîñòîÿòåëüíî ðåôåðàòû, êóðñîâûå, äèïëîìû â êðàò÷àéøèå ñðîêè
Ðåôåðàòû, êóðñîâûå, äèïëîìíûå ðàáîòû ñòóäåíòîâ: íàó÷èòüñÿ ïèñàòü ñàìîñòîÿòåëüíî.
Êîíòàêòû Îáðàçöû ðàáîò Áåñïëàòíûå ìàòåðèàëû
Êîíñóëüòàöèè Ñïåöèàëüíîñòè Áàíê ðåôåðàòîâ
Êàðòà ñàéòà Ñòàòüè Ïîäáîð ëèòåðàòóðû
Íàó÷èì ïèñàòü ðåôåðàòû, êóðñîâûå è äèïëîìû.


ïîäáîð ëèòåðàòóðû ïåðèîäè÷åñêèå èñòî÷íèêè ëèòåðàòóðà ïî ïðåäìåòó

Âîñïîëüçóéòåñü ôîðìîé ïîèñêà ïî ñàéòó, ÷òîáû ïîäîáðàòü ïîëíûé ñïèñîê èñïîëüçîâàííîé ëèòåðàòóðû.
Åñëè âû õîòèòå âûáðàòü äëÿ ñïèñêà ëèòåðàòóðû êíèãè îïðåäåëåííîãî ãîäà èçäàíèÿ, äîñòàòî÷íî äîïèñàòü åãî ê ïîèñêîâîìó çàïðîñó.

Ðåçóëüòàòû ïîèñêà

Ïîèñê ìàòåðèàëîâ

Áèáëèîãðàôèÿ Ïåðèîäèêà

Ëó÷øèå ðåçóëüòàòû

  1. R. "Tee" Williams. An Introduction to Trading in the Financial Markets SET. – Ì.: , 2012. – 1000 ñ.
  2. Harry P. Bowen, Abraham Hollander, Jean-Marie Viaene. Applied International Trade. – Ì.: , 2012. – 568 ñ.
  3. Stephen L. Nelson. QuickBooks 2002 for Dummies. – Ì.: , 0. – 0 ñ.
  4. Stephen Few. Show Me The Numbers: Designing Tables And Graphs To Enlighten. – Ì.: Analytics Press, 2004. – 280 ñ.
  5. Joiner Associates Staff. How to Graph Plain and Simple (Student Edition). – Ì.: , 0. – 0 ñ.
  6. Thomas Miron. The How-To Book for SAS/GRAPH Software. – Ì.: , 0. – 0 ñ.
  7. R. Venkata Rao. Decision Making in the Manufacturing Environment: Using Graph Theory and Fuzzy Multiple Attribute Decision Making Methods (Springer Series in Advanced Manufacturing). – Ì.: , 2007. – 391 ñ.
  8. Alan Gibbons. Algorithmic Graph Theory. – Ì.: , 0. – 0 ñ.
  9. Hiroshi Nagamochi, Toshihide Ibaraki. Algorithmic Aspects of Graph Connectivity (Encyclopedia of Mathematics and its Applications). – Ì.: , 2008. – 392 ñ.
  10. Martin Charles Golumbic. Algorithmic Graph Theory and Perfect Graphs (ANNALS OF DISCRETE MATHEMATICS). – Ì.: , 0. – 0 ñ.
  11. Peter Vizmuller. Design Centering Using Mu-Sigma Graphs and System Simulation. – Ì.: , 0. – 0 ñ.
  12. Bodach, Vijaya K. Pie Graphs (Making Graphs). – Ì.: , 2008. – 750 ñ.
  13. Gary Chartrand, Ping Zhang. Chromatic Graph Theory (Discrete Mathematics and Its Applications). – Ì.: , 2008. – 504 ñ.
  14. J.A. Bondy, U.S.R Murty. Graph Theory (Graduate Texts in Mathematics). – Ì.: , 2008. – 654 ñ.
  15. Emerging Topics on Differential Geometry and Graph Theory. – Ì.: , 2010. – 0 ñ.
  16. Graph-Theoretic Concepts in Computer Science: 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009, Revised Papers (Lecture Notes ... Computer Science and General Issues). – Ì.: , 2010. – 353 ñ.
  17. A.T. White. Graphs of Groups on Surfaces,188. – Ì.: , 2010. – 378 ñ.
  18. D. de Werra. Graph Colouring and Variations. – Ì.: , 2010. – 0 ñ.
  19. J. Akiyama. Graph Theory and Applications. – Ì.: , 2010. – 0 ñ.
  20. Author Unknown. Advances in graph theory,3. – Ì.: , 2010. – 0 ñ.
  21. N.V.R. Mahadev. Threshold Graphs and Related Topics,56. – Ì.: , 2010. – 0 ñ.
  22. M. Karonski. Random Graphs '85. – Ì.: , 2010. – 0 ñ.
  23. P. Hansen. Studies on Graphs and Discrete Programming. – Ì.: , 2010. – 0 ñ.
  24. B. Bollob+ís. Graph Theory. – Ì.: , 2010. – 0 ñ.
  25. M. Rosenfeld. Convexity and Graph Theory. – Ì.: , 2010. – 0 ñ.
  26. V. Chv+ítal. Topics on Perfect Graphs. – Ì.: , 2010. – 0 ñ.
  27. B.R. Alspach. Cycles in Graphs. – Ì.: , 2010. – 0 ñ.
  28. A. Rucinski. Random Graphs '83. – Ì.: , 2010. – 0 ñ.
  29. C. Berge. Graphs. – Ì.: , 2010. – 0 ñ.
  30. Sun–joo Shin. The Iconic Logic of Peirces Graphs. – Ì.: , 2002. – 208 ñ.
  31. Frank T Leighton. Complexity Issues in VLSI – Optimal Layouts for the Shuffle–Exchange Graph & Other Networks. – Ì.: , 2003. – 156 ñ.
  32. Mohar. Graphs on Surfaces. – Ì.: , 2001. – 304 ñ.
  33. Lynette Long. Great Graphs and Sensational Statistics. – Ì.: , 2004. – 128 ñ.
  34. Carl Swenson. Graphing Calculator Guide for the TI–84/83. – Ì.: , 2005. – 120 ñ.
  35. Mehran Mesbahi. Graph Theoretic Methods in MultiAgent Networks. – Ì.: , 2010. – 413 ñ.
  36. Carl Swenson. Getting Started with the TI–86/85 Graphing Calculator. – Ì.: , 1998. – 192 ñ.
  37. Carl Swenson. Getting Started with the TI–83/82 Graphing Calculator. – Ì.: , 1998. – 176 ñ.
  38. Robin J. Wilson. Graphs. – Ì.: , 1990. – 352 ñ.
  39. O ORE. Ore: ?graphs? & Their Uses Revised Edition (pr Onl Y). – Ì.: , 1990. – 160 ñ.
  40. I GROSSMAN. Grossman ?groups? And Their Graphs. – Ì.: , 1978. – 0 ñ.
  41. O ORE. Ore ?graphs? And Their Uses. – Ì.: , 1978. – 0 ñ.
  42. C. C. Edwards. TI–89 Graphing Calculator For Dummies®. – Ì.: , 2005. – 360 ñ.
  43. HT LAU. Lau: ?algorithms? On Graphs. – Ì.: , 1990. – 238 ñ.
  44. AJ BLUNDELL. Blundell: Bond ?graphs? For Modelling Engineering Systems. – Ì.: , 1983. – 152 ñ.
  45. Eric Connally. Graphing Calculator Guide for the TI–83 to accompany Functions Modeling Change: A Preparation for Calculus, 2nd Edition. – Ì.: , 2003. – 160 ñ.
  46. Mokhtar Khorshid. Solving Multi-Agent Pathfinding Problems on Graphs in Polynomial Time. – Ì.: LAP Lambert Academic Publishing, 2012. – 84 ñ.
  47. Sanjay Kumar Pal and Samar Sen Sarma. Allurement of Some Graph Algorithms. – Ì.: LAP Lambert Academic Publishing, 2012. – 112 ñ.
  48. Emrah Asan. Video Shot Boundary Detection by Graph Theoretic Approaches. – Ì.: LAP Lambert Academic Publishing, 2011. – 128 ñ.
  49. Manoj Kumar Singh,Bharat Raj Singh and M.A. Faruqi. Modeling And Simulation Of Dynamic Half Car Using Bond Graph. – Ì.: LAP Lambert Academic Publishing, 2014. – 104 ñ.
  50. Khee Lam Low,Mohd Zubir Mat Jafri and Sohail Aziz Khan. Band Structure Graph of Metallic Photonic Crystals. – Ì.: LAP Lambert Academic Publishing, 2011. – 52 ñ.
  51. Shoaib Khan and Brendan Nagle. A Hyper graph Regularity Method for Linear Hypergraphs. – Ì.: LAP Lambert Academic Publishing, 2011. – 56 ñ.
  52. Anita Pal. Sequential and Parallel Algorithms on Intersection Graphs. – Ì.: LAP Lambert Academic Publishing, 2011. – 212 ñ.
  53. S Jeelani Begum. Graph Theory. – Ì.: LAP Lambert Academic Publishing, 2011. – 144 ñ.
  54. Abd Essalam Badoud and Mabrouk Khemliche. Bond Graph Modeling and diagnosis in wind energy conversion system. – Ì.: LAP Lambert Academic Publishing, 2014. – 92 ñ.
  55. Bohumil Brtnik. Full-Graph Solution of Switched Circuits. – Ì.: LAP Lambert Academic Publishing, 2011. – 72 ñ.
  56. Sambhu Charan Barman. Some Algorithms on Intersection Graphs. – Ì.: LAP Lambert Academic Publishing, 2013. – 220 ñ.
  57. Milena Bogdanovic. Genetic Algorithms And The Optimization Problems In Graph Theory. – Ì.: LAP Lambert Academic Publishing, 2013. – 72 ñ.
  58. Mohit Kumar,Arjun Singh and Piyush Kapoor. GRAPH CLUSTERING USING RESTRICTED NEIGHBOURHOOD SEARCH ALGORITHM. – Ì.: LAP Lambert Academic Publishing, 2012. – 80 ñ.
  59. Pushmeet Kohli. Minimizing Dynamic and Higher Order Energy Functions using Graph Cuts. – Ì.: LAP Lambert Academic Publishing, 2010. – 152 ñ.
  60. Prohelika Das. NEAR-RING GROUPS, WREATH SUMS AND ASSOCIATED GRAPH THEORETIC CONCEPTS. – Ì.: LAP Lambert Academic Publishing, 2011. – 148 ñ.
  61. Ahmed Noubi Elsawy. Paley Graphs and Their Generalization. – Ì.: LAP Lambert Academic Publishing, 2012. – 52 ñ.
  62. T Tamizh Chelvam and I. Rani. Domination in Circulant Graphs. – Ì.: LAP Lambert Academic Publishing, 2011. – 104 ñ.
  63. Jeegnesh Chhabilbhai Bosamiya and Dineshbhai Keshvlal Thakkar. Graph Critical with Respect to Variants of Domination. – Ì.: LAP Lambert Academic Publishing, 2012. – 132 ñ.
  64. Murat Besenk. Signature Cycles and Graphs. – Ì.: LAP Lambert Academic Publishing, 2012. – 124 ñ.
  65. Akram Attar and Baloo Waphare. Reducibility of Graphs and Digraphs. – Ì.: LAP Lambert Academic Publishing, 2013. – 148 ñ.
  66. Anurag Sharma. Application of Graph Theory in Operational Research Problems. – Ì.: LAP Lambert Academic Publishing, 2012. – 168 ñ.
  67. Saeid Alikhani. Dominating sets and domination polynomials of graphs. – Ì.: LAP Lambert Academic Publishing, 2012. – 160 ñ.
  68. P. Jeyanthi. Studies In Graph Theory - Magic Labeling And Related Concepts. – Ì.: LAP Lambert Academic Publishing, 2012. – 116 ñ.
  69. Sk. Md. Abu Nayeem. Genetic Algorithm Approach to Some Graph Theoretic Problems. – Ì.: LAP Lambert Academic Publishing, 2012. – 200 ñ.
  70. Sunita Kumawat and G. N. Purohit. A Graph Theoretic Approach: Petri Net. – Ì.: LAP Lambert Academic Publishing, 2012. – 204 ñ.
  71. Sunil Mathew and M.S. Sunitha. Fuzzy graphs. – Ì.: LAP Lambert Academic Publishing, 2012. – 120 ñ.
  72. Micheal Arockiaraj and Indra Rajasingh. Mathematical Layout of a Graph Embedding. – Ì.: LAP Lambert Academic Publishing, 2013. – 164 ñ.
  73. Nasreen Khan. Colouring of Cactus Graphs. – Ì.: LAP Lambert Academic Publishing, 2013. – 244 ñ.
  74. Asha Gupta. Closed graph:a topological approach. – Ì.: LAP Lambert Academic Publishing, 2013. – 96 ñ.
  75. Anupalli Sudhakaraiah and V. Ragava Lakshmi. Interval graphs, circular-arc And circular-arc overlaps graphs. – Ì.: LAP Lambert Academic Publishing, 2013. – 128 ñ.
  76. Lucio Prado. Graphs with Potential Theory. – Ì.: LAP Lambert Academic Publishing, 2009. – 156 ñ.
  77. CHANDRASEKHAR RAMASWAMY. SOME RECENT STUDIES IN GRAPH THEORY. – Ì.: LAP Lambert Academic Publishing, 2010. – 116 ñ.
  78. Nakkina Ramakrishna. A study of vague groups, vague universal algebras and vague graphs. – Ì.: LAP Lambert Academic Publishing, 2011. – 172 ñ.
  79. Vinh Kha Nguyen. Family of circulant graphs and its expander properties. – Ì.: LAP Lambert Academic Publishing, 2011. – 76 ñ.
  80. S. Jeelani Begum and B. Maheswari. Graph Theory. – Ì.: LAP Lambert Academic Publishing, 2012. – 64 ñ.
  81. Yamuna Manimuthu and Karthika Kumarasamy. Domination Stable Graphs. – Ì.: LAP Lambert Academic Publishing, 2012. – 108 ñ.
  82. T. Tamizh Chelvam,T. Asir and G. S. Grace Prema. Inverse Domination in Graphs. – Ì.: LAP Lambert Academic Publishing, 2013. – 120 ñ.
  83. Nishad T. M. Strong and Weak Graphs Theory and Applications. – Ì.: LAP Lambert Academic Publishing, 2013. – 64 ñ.
  84. Hongmei He. Algorithms on the Book Crossing Number Problem of Graphs. – Ì.: LAP Lambert Academic Publishing, 2014. – 308 ñ.
  85. Anupalli Sudhakaraiah and V. Ramalatha. Studies On Dominating Sets Of I G & C A Graphs Using Algorithms. – Ì.: LAP Lambert Academic Publishing, 2014. – 180 ñ.
  86. Mohammed Seoud,Manal Harere and Mohammed Anwar. Combination and Permutation Graphs. – Ì.: LAP Lambert Academic Publishing, 2013. – 72 ñ.
  87. Dushyant Tanna. Handbook to Harmonious Labelings of Graphs. – Ì.: LAP Lambert Academic Publishing, 2014. – 60 ñ.
  88. Samina Boxwala. Some Problems in Cordial Labelings of Graphs. – Ì.: LAP Lambert Academic Publishing, 2014. – 180 ñ.
  89. Khalida M. Nazzal. On the Domination Number of the Cartesian Product of Graphs. – Ì.: LAP Lambert Academic Publishing, 2014. – 160 ñ.
  90. Ramadan El-Shanawany,Hanan Shabana and Ahmed El-Mesady. On Orthogonal Double Covers of Graphs by Graph- path and Graph-Cycle. – Ì.: LAP Lambert Academic Publishing, 2014. – 52 ñ.
  91. ILWOO CHO. Graph Groupoids and Partial Isometries. – Ì.: LAP Lambert Academic Publishing, 2010. – 92 ñ.
  92. ILWOO CHO. Operations on Graphs, Groupoids, and Operator Algebras. – Ì.: LAP Lambert Academic Publishing, 2010. – 112 ñ.
  93. T Tamizh Chelvam and S Robinson Chellathurai. Recent Trends in Domination in Graph Theory. – Ì.: LAP Lambert Academic Publishing, 2011. – 172 ñ.
  94. Herish O. Abdullah and Ali A. Ali. Hosoya Polynomials of Steiner Distance of Some Graphs. – Ì.: LAP Lambert Academic Publishing, 2011. – 180 ñ.
  95. G. Rajasekar. An Introduction to Cyclic Path Covers in Graphs. – Ì.: LAP Lambert Academic Publishing, 2013. – 188 ñ.
  96. Peter Hussami. Statistical inference on random graphs. – Ì.: LAP Lambert Academic Publishing, 2012. – 100 ñ.
  97. Sameena Kalathodi and Sunitha M.S. Distance in Fuzzy Graphs. – Ì.: LAP Lambert Academic Publishing, 2012. – 124 ñ.
  98. Swagat Barot. Spectrum related to graphs. – Ì.: LAP Lambert Academic Publishing, 2013. – 108 ñ.
  99. Levi Molenje. High School Teachers’ Use Of Graphing Calculators. – Ì.: LAP Lambert Academic Publishing, 2014. – 172 ñ.
  100. S. Monikandan and J. Balakumar. Recent Advances in Graph Reconstruction. – Ì.: LAP Lambert Academic Publishing, 2014. – 124 ñ.
  101. Zhifu You,Bolian Liu and Yufei Huang. The Spectral Properties of Graphs. – Ì.: LAP Lambert Academic Publishing, 2014. – 128 ñ.
  102. Nishad T. Mohammed. Metrics in Fuzzy Graph. – Ì.: LAP Lambert Academic Publishing, 2015. – 72 ñ.
  103. Stelian Mihalas. Graph Dimension And Related Colorings. – Ì.: LAP Lambert Academic Publishing, 2010. – 68 ñ.
  104. zebin wang. Colorability of P5-free Graphs. – Ì.: LAP Lambert Academic Publishing, 2010. – 112 ñ.
  105. Martin Kochol. Flows in Graphs and Related Problems. – Ì.: LAP Lambert Academic Publishing, 2010. – 264 ñ.
  106. Kamal Lochan Patra. Laplacian Spectrum and Graph Structure. – Ì.: LAP Lambert Academic Publishing, 2010. – 96 ñ.
  107. Ahmed M. Ali,Ali A. Ali and Tahir H. Ismail. Hosoya Polynomials and Wiener Indices of Distances in Graphs. – Ì.: LAP Lambert Academic Publishing, 2011. – 148 ñ.
  108. Sandip Ramkrishna Pandit. Graph Based Query Specific Multi-document Text Summarization. – Ì.: LAP Lambert Academic Publishing, 2014. – 76 ñ.
  109. Asif Iqbal. Generating Dependency Graphs for Impact Analysis in a Legacy System. – Ì.: LAP Lambert Academic Publishing, 2012. – 184 ñ.
  110. Javad Akbari Torkestani. Graph Theroy and Its Application to Wireless Mobile Ad-Hoc Networking. – Ì.: LAP Lambert Academic Publishing, 2010. – 256 ñ.
  111. Rahul Deshmukh. Benchmarking In Graph Databases. – Ì.: LAP Lambert Academic Publishing, 2014. – 84 ñ.
  112. Elira Maksuti. The Heart Considered as a ?V-pump: a Bond Graph Model. – Ì.: LAP Lambert Academic Publishing, 2013. – 64 ñ.
  113. Dennis Nikiforov. Automatic generation of task graphs. – Ì.: LAP Lambert Academic Publishing, 2010. – 60 ñ.
  114. Ankur Shah and Hemraj Varachhia. Graph Based Web Recommendation System to Improve Time Efficiency. – Ì.: LAP Lambert Academic Publishing, 2014. – 60 ñ.
  115. Marek Honzirek. Dominance in Control Flow Graph. – Ì.: LAP Lambert Academic Publishing, 2011. – 80 ñ.
  116. Ivan Launders. The Transaction Graph:. – Ì.: LAP Lambert Academic Publishing, 2012. – 236 ñ.
  117. Neerajkumar Maurya and Shristi Maurya. An Efficient Algorithm For Shortest Path Tree In Dynamic Graph. – Ì.: LAP Lambert Academic Publishing, 2014. – 68 ñ.
  118. Yijin Wu. Efficient Failure Recovery in Large-scale Graph Processing Systems. – Ì.: Scholars' Press, 2014. – 88 ñ.
  119. Alireza Bagheri and Mohammadreza Razzazi. Drawing Planar Graphs inside Simple Polygons. – Ì.: LAP Lambert Academic Publishing, 2010. – 180 ñ.
  120. Viswanathan K. Iyer. Wiener index of graphs. – Ì.: LAP Lambert Academic Publishing, 2012. – 96 ñ.
  121. Sukumar Reddy Anapalli. Scheduling on Cyclo Static Data Flow Graphs. – Ì.: , 2010. – 88 ñ.
  122. Lakshmi Prabha Sudharsanom. Successful Team Work - Graph Theoretic Approach. – Ì.: , 2015. – 260 ñ.
  123. Richard Brath,David Jonker. Graph Analysis and Visualization: Discovering Business Opportunity in Linked Data. – Ì.: , 2015. –  ñ.

Äîïîëíèòåëüíûå ðåçóëüòàòû

  1. R. "Tee" Williams. An Introduction to Trading in the Financial Markets SET. – Ì.: , 2012. – 1000 ñ.
  2. Harry P. Bowen, Abraham Hollander, Jean-Marie Viaene. Applied International Trade. – Ì.: , 2012. – 568 ñ.
  3. Stephen L. Nelson. QuickBooks 2002 for Dummies. – Ì.: , 0. – 0 ñ.
  4. Jae K., Phd Shim, Jae K. Shim. Accounting and Finance for the NonFinancial Executive: An Integrated Resource Management Guide for the 21st Century. – Ì.: , 0. – 0 ñ.
  5. Nicholas Teebagy, Amir D. Aczel, Amir D. Aczel. The Math Behind Wall Street: How the Market Works and How to Make It Work for You. – Ì.: , 0. – 0 ñ.
  6. Marc Robinson. Essential Finance Series: Investing Basics. – Ì.: , 0. – 0 ñ.
  7. Gale. Education: Meeting America's Needs (Information Plus Reference Series). – Ì.: , 2012. – 160 ñ.
  8. Gale. Sports In America: Recreation, Business, Education and Controversey (Information Plus Reference). – Ì.: , 2012. – 160 ñ.
  9. Marcellus Andrews. The Political Economy of Hope and Fear: Capitalism and the Black Condition in America. – Ì.: , 0. – 0 ñ.
  10. Johan Norberg, Roger Tanner, JULIAN SANCHEZ. In Defense of Global Capitalism. – Ì.: , 0. – 0 ñ.
  11. Marcellus Andrews. The Political Economy of Hope and Fear. – Ì.: , 0. – 0 ñ.
  12. The World Bank. World Bank Atlas 2000. – Ì.: , 0. – 0 ñ.
  13. Charles Wheelan. Naked Economics: Undressing the Dismal Science. – Ì.: W. W. Norton & Company, Inc., 2003. – 260 ñ.
  14. Dominick Salvatore, Eugene A. Diulio, Dominick Salvatore. Schaum's Outline of Principles of Economics (Schaum's). – Ì.: , 0. – 0 ñ.
  15. David Anderson. Cracking the Ap Economics: Macro & Micro Exams 2004-2005 (Princeton Review Series). – Ì.: , 0. – 0 ñ.
  16. Robert L. Sexton. Essentials of Economics With Infotrac. – Ì.: , 0. – 0 ñ.
  17. A. C. Atkinson, Marco Riani, Anthony Atkinson. Robust Diagnostic Regression Analysis. – Ì.: , 0. – 0 ñ.
  18. Karl E. Case, Ray C. Fair. Activebook Version 1.0 Principles of Microeconomics. – Ì.: , 0. – 0 ñ.
  19. Jae K. Shim, Joel G. Siegel. Dictionary of Economics. – Ì.: , 0. – 0 ñ.
  20. Jae K. Shim. Strategic Business Forecasting: The Complete Guide to Forecasting Real World Company Performance, Revised Edition. – Ì.: CRC Press, 2000. – 312 ñ.
  21. Stephen Few. Show Me The Numbers: Designing Tables And Graphs To Enlighten. – Ì.: Analytics Press, 2004. – 280 ñ.
  22. Joiner Associates Staff. How to Graph Plain and Simple (Student Edition). – Ì.: , 0. – 0 ñ.
  23. Thomas Miron. The How-To Book for SAS/GRAPH Software. – Ì.: , 0. – 0 ñ.
  24. R. Venkata Rao. Decision Making in the Manufacturing Environment: Using Graph Theory and Fuzzy Multiple Attribute Decision Making Methods (Springer Series in Advanced Manufacturing). – Ì.: , 2007. – 391 ñ.
  25. Alan Gibbons. Algorithmic Graph Theory. – Ì.: , 0. – 0 ñ.
  26. Hiroshi Nagamochi, Toshihide Ibaraki. Algorithmic Aspects of Graph Connectivity (Encyclopedia of Mathematics and its Applications). – Ì.: , 2008. – 392 ñ.
  27. Martin Charles Golumbic. Algorithmic Graph Theory and Perfect Graphs (ANNALS OF DISCRETE MATHEMATICS). – Ì.: , 0. – 0 ñ.
  28. Peter Vizmuller. Design Centering Using Mu-Sigma Graphs and System Simulation. – Ì.: , 0. – 0 ñ.
  29. Bodach, Vijaya K. Pie Graphs (Making Graphs). – Ì.: , 2008. – 750 ñ.
  30. Gary Chartrand, Ping Zhang. Chromatic Graph Theory (Discrete Mathematics and Its Applications). – Ì.: , 2008. – 504 ñ.
  31. J.A. Bondy, U.S.R Murty. Graph Theory (Graduate Texts in Mathematics). – Ì.: , 2008. – 654 ñ.
  32. Emerging Topics on Differential Geometry and Graph Theory. – Ì.: , 2010. – 0 ñ.
  33. Graph-Theoretic Concepts in Computer Science: 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009, Revised Papers (Lecture Notes ... Computer Science and General Issues). – Ì.: , 2010. – 353 ñ.
  34. A.T. White. Graphs of Groups on Surfaces,188. – Ì.: , 2010. – 378 ñ.
  35. D. de Werra. Graph Colouring and Variations. – Ì.: , 2010. – 0 ñ.
  36. J. Akiyama. Graph Theory and Applications. – Ì.: , 2010. – 0 ñ.
  37. Author Unknown. Advances in graph theory,3. – Ì.: , 2010. – 0 ñ.
  38. N.V.R. Mahadev. Threshold Graphs and Related Topics,56. – Ì.: , 2010. – 0 ñ.
  39. M. Karonski. Random Graphs '85. – Ì.: , 2010. – 0 ñ.
  40. P. Hansen. Studies on Graphs and Discrete Programming. – Ì.: , 2010. – 0 ñ.
  41. B. Bollob+ís. Graph Theory. – Ì.: , 2010. – 0 ñ.
  42. M. Rosenfeld. Convexity and Graph Theory. – Ì.: , 2010. – 0 ñ.
  43. V. Chv+ítal. Topics on Perfect Graphs. – Ì.: , 2010. – 0 ñ.
  44. B.R. Alspach. Cycles in Graphs. – Ì.: , 2010. – 0 ñ.
  45. A. Rucinski. Random Graphs '83. – Ì.: , 2010. – 0 ñ.
  46. C. Berge. Graphs. – Ì.: , 2010. – 0 ñ.
  47. Sun–joo Shin. The Iconic Logic of Peirces Graphs. – Ì.: , 2002. – 208 ñ.
  48. Frank T Leighton. Complexity Issues in VLSI – Optimal Layouts for the Shuffle–Exchange Graph & Other Networks. – Ì.: , 2003. – 156 ñ.
  49. Mohar. Graphs on Surfaces. – Ì.: , 2001. – 304 ñ.
  50. Lynette Long. Great Graphs and Sensational Statistics. – Ì.: , 2004. – 128 ñ.
  51. Carl Swenson. Graphing Calculator Guide for the TI–84/83. – Ì.: , 2005. – 120 ñ.
  52. Mehran Mesbahi. Graph Theoretic Methods in MultiAgent Networks. – Ì.: , 2010. – 413 ñ.
  53. Carl Swenson. Getting Started with the TI–86/85 Graphing Calculator. – Ì.: , 1998. – 192 ñ.
  54. Carl Swenson. Getting Started with the TI–83/82 Graphing Calculator. – Ì.: , 1998. – 176 ñ.
  55. Robin J. Wilson. Graphs. – Ì.: , 1990. – 352 ñ.
  56. O ORE. Ore: ?graphs? & Their Uses Revised Edition (pr Onl Y). – Ì.: , 1990. – 160 ñ.
  57. I GROSSMAN. Grossman ?groups? And Their Graphs. – Ì.: , 1978. – 0 ñ.
  58. O ORE. Ore ?graphs? And Their Uses. – Ì.: , 1978. – 0 ñ.
  59. C. C. Edwards. TI–89 Graphing Calculator For Dummies®. – Ì.: , 2005. – 360 ñ.
  60. HT LAU. Lau: ?algorithms? On Graphs. – Ì.: , 1990. – 238 ñ.
  61. AJ BLUNDELL. Blundell: Bond ?graphs? For Modelling Engineering Systems. – Ì.: , 1983. – 152 ñ.
  62. Eric Connally. Graphing Calculator Guide for the TI–83 to accompany Functions Modeling Change: A Preparation for Calculus, 2nd Edition. – Ì.: , 2003. – 160 ñ.
  63. Mokhtar Khorshid. Solving Multi-Agent Pathfinding Problems on Graphs in Polynomial Time. – Ì.: LAP Lambert Academic Publishing, 2012. – 84 ñ.
  64. Sanjay Kumar Pal and Samar Sen Sarma. Allurement of Some Graph Algorithms. – Ì.: LAP Lambert Academic Publishing, 2012. – 112 ñ.
  65. Emrah Asan. Video Shot Boundary Detection by Graph Theoretic Approaches. – Ì.: LAP Lambert Academic Publishing, 2011. – 128 ñ.
  66. Manoj Kumar Singh,Bharat Raj Singh and M.A. Faruqi. Modeling And Simulation Of Dynamic Half Car Using Bond Graph. – Ì.: LAP Lambert Academic Publishing, 2014. – 104 ñ.
  67. Khee Lam Low,Mohd Zubir Mat Jafri and Sohail Aziz Khan. Band Structure Graph of Metallic Photonic Crystals. – Ì.: LAP Lambert Academic Publishing, 2011. – 52 ñ.
  68. Shoaib Khan and Brendan Nagle. A Hyper graph Regularity Method for Linear Hypergraphs. – Ì.: LAP Lambert Academic Publishing, 2011. – 56 ñ.
  69. Anita Pal. Sequential and Parallel Algorithms on Intersection Graphs. – Ì.: LAP Lambert Academic Publishing, 2011. – 212 ñ.
  70. S Jeelani Begum. Graph Theory. – Ì.: LAP Lambert Academic Publishing, 2011. – 144 ñ.
  71. Abd Essalam Badoud and Mabrouk Khemliche. Bond Graph Modeling and diagnosis in wind energy conversion system. – Ì.: LAP Lambert Academic Publishing, 2014. – 92 ñ.
  72. Bohumil Brtnik. Full-Graph Solution of Switched Circuits. – Ì.: LAP Lambert Academic Publishing, 2011. – 72 ñ.
  73. Sambhu Charan Barman. Some Algorithms on Intersection Graphs. – Ì.: LAP Lambert Academic Publishing, 2013. – 220 ñ.
  74. Milena Bogdanovic. Genetic Algorithms And The Optimization Problems In Graph Theory. – Ì.: LAP Lambert Academic Publishing, 2013. – 72 ñ.
  75. Mohit Kumar,Arjun Singh and Piyush Kapoor. GRAPH CLUSTERING USING RESTRICTED NEIGHBOURHOOD SEARCH ALGORITHM. – Ì.: LAP Lambert Academic Publishing, 2012. – 80 ñ.
  76. Pushmeet Kohli. Minimizing Dynamic and Higher Order Energy Functions using Graph Cuts. – Ì.: LAP Lambert Academic Publishing, 2010. – 152 ñ.
  77. Prohelika Das. NEAR-RING GROUPS, WREATH SUMS AND ASSOCIATED GRAPH THEORETIC CONCEPTS. – Ì.: LAP Lambert Academic Publishing, 2011. – 148 ñ.
  78. Ahmed Noubi Elsawy. Paley Graphs and Their Generalization. – Ì.: LAP Lambert Academic Publishing, 2012. – 52 ñ.
  79. T Tamizh Chelvam and I. Rani. Domination in Circulant Graphs. – Ì.: LAP Lambert Academic Publishing, 2011. – 104 ñ.
  80. Jeegnesh Chhabilbhai Bosamiya and Dineshbhai Keshvlal Thakkar. Graph Critical with Respect to Variants of Domination. – Ì.: LAP Lambert Academic Publishing, 2012. – 132 ñ.
  81. Murat Besenk. Signature Cycles and Graphs. – Ì.: LAP Lambert Academic Publishing, 2012. – 124 ñ.
  82. Akram Attar and Baloo Waphare. Reducibility of Graphs and Digraphs. – Ì.: LAP Lambert Academic Publishing, 2013. – 148 ñ.
  83. Anurag Sharma. Application of Graph Theory in Operational Research Problems. – Ì.: LAP Lambert Academic Publishing, 2012. – 168 ñ.
  84. Saeid Alikhani. Dominating sets and domination polynomials of graphs. – Ì.: LAP Lambert Academic Publishing, 2012. – 160 ñ.
  85. P. Jeyanthi. Studies In Graph Theory - Magic Labeling And Related Concepts. – Ì.: LAP Lambert Academic Publishing, 2012. – 116 ñ.
  86. Sk. Md. Abu Nayeem. Genetic Algorithm Approach to Some Graph Theoretic Problems. – Ì.: LAP Lambert Academic Publishing, 2012. – 200 ñ.
  87. Sunita Kumawat and G. N. Purohit. A Graph Theoretic Approach: Petri Net. – Ì.: LAP Lambert Academic Publishing, 2012. – 204 ñ.
  88. Sunil Mathew and M.S. Sunitha. Fuzzy graphs. – Ì.: LAP Lambert Academic Publishing, 2012. – 120 ñ.
  89. Micheal Arockiaraj and Indra Rajasingh. Mathematical Layout of a Graph Embedding. – Ì.: LAP Lambert Academic Publishing, 2013. – 164 ñ.
  90. Nasreen Khan. Colouring of Cactus Graphs. – Ì.: LAP Lambert Academic Publishing, 2013. – 244 ñ.
  91. Asha Gupta. Closed graph:a topological approach. – Ì.: LAP Lambert Academic Publishing, 2013. – 96 ñ.
  92. Anupalli Sudhakaraiah and V. Ragava Lakshmi. Interval graphs, circular-arc And circular-arc overlaps graphs. – Ì.: LAP Lambert Academic Publishing, 2013. – 128 ñ.
  93. Lucio Prado. Graphs with Potential Theory. – Ì.: LAP Lambert Academic Publishing, 2009. – 156 ñ.
  94. CHANDRASEKHAR RAMASWAMY. SOME RECENT STUDIES IN GRAPH THEORY. – Ì.: LAP Lambert Academic Publishing, 2010. – 116 ñ.
  95. Nakkina Ramakrishna. A study of vague groups, vague universal algebras and vague graphs. – Ì.: LAP Lambert Academic Publishing, 2011. – 172 ñ.
  96. Vinh Kha Nguyen. Family of circulant graphs and its expander properties. – Ì.: LAP Lambert Academic Publishing, 2011. – 76 ñ.
  97. S. Jeelani Begum and B. Maheswari. Graph Theory. – Ì.: LAP Lambert Academic Publishing, 2012. – 64 ñ.
  98. Yamuna Manimuthu and Karthika Kumarasamy. Domination Stable Graphs. – Ì.: LAP Lambert Academic Publishing, 2012. – 108 ñ.
  99. T. Tamizh Chelvam,T. Asir and G. S. Grace Prema. Inverse Domination in Graphs. – Ì.: LAP Lambert Academic Publishing, 2013. – 120 ñ.
  100. Nishad T. M. Strong and Weak Graphs Theory and Applications. – Ì.: LAP Lambert Academic Publishing, 2013. – 64 ñ.
  101. Hongmei He. Algorithms on the Book Crossing Number Problem of Graphs. – Ì.: LAP Lambert Academic Publishing, 2014. – 308 ñ.
  102. Anupalli Sudhakaraiah and V. Ramalatha. Studies On Dominating Sets Of I G & C A Graphs Using Algorithms. – Ì.: LAP Lambert Academic Publishing, 2014. – 180 ñ.
  103. Mohammed Seoud,Manal Harere and Mohammed Anwar. Combination and Permutation Graphs. – Ì.: LAP Lambert Academic Publishing, 2013. – 72 ñ.
  104. Dushyant Tanna. Handbook to Harmonious Labelings of Graphs. – Ì.: LAP Lambert Academic Publishing, 2014. – 60 ñ.
  105. Samina Boxwala. Some Problems in Cordial Labelings of Graphs. – Ì.: LAP Lambert Academic Publishing, 2014. – 180 ñ.
  106. Khalida M. Nazzal. On the Domination Number of the Cartesian Product of Graphs. – Ì.: LAP Lambert Academic Publishing, 2014. – 160 ñ.
  107. Ramadan El-Shanawany,Hanan Shabana and Ahmed El-Mesady. On Orthogonal Double Covers of Graphs by Graph- path and Graph-Cycle. – Ì.: LAP Lambert Academic Publishing, 2014. – 52 ñ.
  108. ILWOO CHO. Graph Groupoids and Partial Isometries. – Ì.: LAP Lambert Academic Publishing, 2010. – 92 ñ.
  109. ILWOO CHO. Operations on Graphs, Groupoids, and Operator Algebras. – Ì.: LAP Lambert Academic Publishing, 2010. – 112 ñ.
  110. T Tamizh Chelvam and S Robinson Chellathurai. Recent Trends in Domination in Graph Theory. – Ì.: LAP Lambert Academic Publishing, 2011. – 172 ñ.
  111. Herish O. Abdullah and Ali A. Ali. Hosoya Polynomials of Steiner Distance of Some Graphs. – Ì.: LAP Lambert Academic Publishing, 2011. – 180 ñ.
  112. G. Rajasekar. An Introduction to Cyclic Path Covers in Graphs. – Ì.: LAP Lambert Academic Publishing, 2013. – 188 ñ.
  113. Peter Hussami. Statistical inference on random graphs. – Ì.: LAP Lambert Academic Publishing, 2012. – 100 ñ.
  114. Sameena Kalathodi and Sunitha M.S. Distance in Fuzzy Graphs. – Ì.: LAP Lambert Academic Publishing, 2012. – 124 ñ.
  115. Swagat Barot. Spectrum related to graphs. – Ì.: LAP Lambert Academic Publishing, 2013. – 108 ñ.
  116. Levi Molenje. High School Teachers’ Use Of Graphing Calculators. – Ì.: LAP Lambert Academic Publishing, 2014. – 172 ñ.
  117. S. Monikandan and J. Balakumar. Recent Advances in Graph Reconstruction. – Ì.: LAP Lambert Academic Publishing, 2014. – 124 ñ.
  118. Zhifu You,Bolian Liu and Yufei Huang. The Spectral Properties of Graphs. – Ì.: LAP Lambert Academic Publishing, 2014. – 128 ñ.
  119. Nishad T. Mohammed. Metrics in Fuzzy Graph. – Ì.: LAP Lambert Academic Publishing, 2015. – 72 ñ.
  120. Stelian Mihalas. Graph Dimension And Related Colorings. – Ì.: LAP Lambert Academic Publishing, 2010. – 68 ñ.
  121. zebin wang. Colorability of P5-free Graphs. – Ì.: LAP Lambert Academic Publishing, 2010. – 112 ñ.
  122. Martin Kochol. Flows in Graphs and Related Problems. – Ì.: LAP Lambert Academic Publishing, 2010. – 264 ñ.
  123. Kamal Lochan Patra. Laplacian Spectrum and Graph Structure. – Ì.: LAP Lambert Academic Publishing, 2010. – 96 ñ.
  124. Ahmed M. Ali,Ali A. Ali and Tahir H. Ismail. Hosoya Polynomials and Wiener Indices of Distances in Graphs. – Ì.: LAP Lambert Academic Publishing, 2011. – 148 ñ.
  125. Sandip Ramkrishna Pandit. Graph Based Query Specific Multi-document Text Summarization. – Ì.: LAP Lambert Academic Publishing, 2014. – 76 ñ.
  126. Asif Iqbal. Generating Dependency Graphs for Impact Analysis in a Legacy System. – Ì.: LAP Lambert Academic Publishing, 2012. – 184 ñ.
  127. Javad Akbari Torkestani. Graph Theroy and Its Application to Wireless Mobile Ad-Hoc Networking. – Ì.: LAP Lambert Academic Publishing, 2010. – 256 ñ.
  128. Rahul Deshmukh. Benchmarking In Graph Databases. – Ì.: LAP Lambert Academic Publishing, 2014. – 84 ñ.
  129. Elira Maksuti. The Heart Considered as a ?V-pump: a Bond Graph Model. – Ì.: LAP Lambert Academic Publishing, 2013. – 64 ñ.
  130. Dennis Nikiforov. Automatic generation of task graphs. – Ì.: LAP Lambert Academic Publishing, 2010. – 60 ñ.
  131. Ankur Shah and Hemraj Varachhia. Graph Based Web Recommendation System to Improve Time Efficiency. – Ì.: LAP Lambert Academic Publishing, 2014. – 60 ñ.
  132. Marek Honzirek. Dominance in Control Flow Graph. – Ì.: LAP Lambert Academic Publishing, 2011. – 80 ñ.
  133. Ivan Launders. The Transaction Graph:. – Ì.: LAP Lambert Academic Publishing, 2012. – 236 ñ.
  134. Neerajkumar Maurya and Shristi Maurya. An Efficient Algorithm For Shortest Path Tree In Dynamic Graph. – Ì.: LAP Lambert Academic Publishing, 2014. – 68 ñ.
  135. Yijin Wu. Efficient Failure Recovery in Large-scale Graph Processing Systems. – Ì.: Scholars' Press, 2014. – 88 ñ.
  136. Alireza Bagheri and Mohammadreza Razzazi. Drawing Planar Graphs inside Simple Polygons. – Ì.: LAP Lambert Academic Publishing, 2010. – 180 ñ.
  137. Viswanathan K. Iyer. Wiener index of graphs. – Ì.: LAP Lambert Academic Publishing, 2012. – 96 ñ.
  138. Sukumar Reddy Anapalli. Scheduling on Cyclo Static Data Flow Graphs. – Ì.: , 2010. – 88 ñ.
  139. Lakshmi Prabha Sudharsanom. Successful Team Work - Graph Theoretic Approach. – Ì.: , 2015. – 260 ñ.
  140. Richard Brath,David Jonker. Graph Analysis and Visualization: Discovering Business Opportunity in Linked Data. – Ì.: , 2015. –  ñ.

Ëó÷øèå ðåçóëüòàòû

Íè÷åãî íå íàéäåíî

Äîïîëíèòåëüíûå ðåçóëüòàòû

Íè÷åãî íå íàéäåíî

Îáðàçöû ðàáîò

Òåìà è ïðåäìåòÒèï è îáúåì ðàáîòû
Îöåíêà ðûíî÷íîé ñòîèìîñòè ñêëàäñêîé íåäâèæèìîñòè íà ïðèìåðå îîî Äèïëîìàò
Îöåíêà áèçíåñà 		Äèïëîìíûé ïðîåêò
102 ñòð.

Èñêàòü äðóãèå òåìû

Çàäàéòå ñâîé âîïðîñ ïî âàøåé òåìå

Ãëàäûøåâà Ìàðèíà Ìèõàéëîâíà

marina@studentochka.ru
+7 911 822-56-12
ñ 9 äî 21 ÷. ïî Ìîñêâå.
Çàêàçàòü ñîïðîâîæäåíèå Îáñóäèòü öåíó è óñëîâèÿ êîíñóëüòàöèé






Äîáàâèòü ôàéë

- îñòàëîñü íàïèñàòü email èëè òåëåôîí
Êîíòàêòû
marina@studentochka.ru
+7 911 822-56-12
ñ 9 äî 21 ÷. ïî Ìîñêâå.
Ïîäåëèòüñÿ
Ìû â ñîöèàëüíûõ ñåòÿõ
Ðåêëàìà



Îòçûâû
AVT
Çäðàâñòâóéòå Ìàðèíà! Õî÷ó Âàì ñêàçàòü áîëüøîå ñïàñèáî çà äèïëîì, õîòü è ïðèøëîñü åãî íå ìíîãî ïîäðåñòàâðèðîâàòü ïîä ñâîþ îðãàíèçàöèþ, íî â öåëîì âñ¸ ÎÊ. ß ïîëó÷èë âûñîêèå îöåíêè çà äàííóþ ðàáîòó ïîñëå âàøåãî ñîïðîâîæäåíèÿ. Åù¸ ðàç áîëüøîå ñïàñèáî!