www.bookin.org.ru Книги Интернет магазин +79015461416

    есть на складе           
Салаты сборник рецептов

 Distance-Regular Graph Every distance-transitive graph is distance regular. High Quality Content by WIKIPEDIA articles! Indeed, distance-regular graphs were introduced as a
Наименование:

Distance-Regular Graph

автор Niek Y. издательство Книга по Требованию Основы программирования и алгоритмы
Cтраниц 72        мягкая обложка       
Аннотация:Every distance-transitive graph is distance regular. High Quality Content by WIKIPEDIA articles! Indeed, distance-regular graphs were introduced as a combinatorial generalization of distance-transitive graphs, having the numerical regularity properties of the latter without necessarily having a large automorphism group. A distance-regular graph with diameter 2 is strongly regular, and conversely (unless the graph is disconnected). Alternatively, a distance-regular graph is a graph for which there exist integers bi,ci,i=0,. . . ,d such that for any two vertices x,y in G and distance i=d(x,y), there are exactly ci neighbors of y in Gi-1(x) and bi neighbors of y in Gi+1(x), where Gi(x) is the set of vertices y of G with d(x,y)=i (Brouwer et al. 1989, p. 434). The array of integers characterizing a distance-regular graph is known as its intersection array. In mathematics, a distance-regular graph is a regular graph such that for any two vertices v and w at distance i the number of vertices adjacent to w and at distance j from v is the same.
Автор: Niek Y.
Издательство: Книга по Требованию
Год:2010
Цена:
1190 руб
Нет в наличии
Поиск: Distance-Regular Graph
НОВЫЙ ГОД СИМВОЛ 2013 ГОДАУКРАШЕНИЯ
КАРНАВАЛ НА НОВЫЙ ГОД РАСПРОДАЖА
Ортомолекулярная медицина Orthomol Устрание причин заболеваний. Ортомоль это новый метод для лечения и профилактики болезней. Orthomol - ортомолекулярная медицина.
Системы, управляемые потоком данных. Язык "Dataflow Graph...

Если выход ou имеет несколько каналов, то его i-й канал обозначается на схеме строкой ou . Для подсчета числа Пи используется несколько рабочих процессов,  которые вычисляют свои части интеграла и пересылают результат суммирующему процессу. Рабочие процессы обращаются за очередным заданием к процессу распределения работ. Вся работа не распределяется заранее равномерно между процессами: один рабочий процесс, если он запущен на более быстрой машине, может выполнить львиную долю работы. Из входа um i er процесс Summer считывает число частичных сумм,  которые он должен просуммировать до завершения своей работы. На вход arg процесса Worker поступает задание: границы и число интервалов. Если число интервалов в задании равно нулю, то процесс завершает работу. Пересылая свой идентификатор через выход dema d рабочий процесс обращается за очередным заданием. Запись графа потока данных на языке Da a Graph La guage Перевод графа потока данных в язык DGL совершается однозначным образом. В записи на DGL каждый процесс представлен заголовком и списком входных и выходных портов.
Пенал "Гонка", 19х11 см, 3 отделения.
Пенал предназначен для школьников 7-10 лет. Является важным помощником в учебе, ведь он решает задачу хранения ручек, карандашей и прочих
511 руб
Раздел: Без наполнения
Конструктор электронный "Знаток". 320 схем.
Набор электронных блоков и соединений, позволяющий конструировать электрические цепи без пайки. Описано 320 схем. Даже без помощи
2858 руб
Раздел: Инженерные, научно-технические
Ящик с крышкой Darel Box на колесах, 61x40x17.5 см.
Универсальные и герметичные боксы идеально подходят для хранения меха, одежды и домашнего текстиля. Герметичность конструкции обеспечивает
494 руб
Раздел: Более 10 литров
C++ Boost Graph Library. Библиотека программистаC++ Boost Graph Library. Библиотека программиста
Издание, являющееся переводом одной из книг серии «C++ in Depth», посвящено описанию Boost Graph Library (BGL) — библиотеки для построения структур данных и алгоритмов вычислений на графах, предназначенных для решения самых разнообразных задач: от Сик Дж. Питер Библиотека программиста 
270 руб
W*-Corresponcences, Finite Directed Graphs and Markov Chains. W*-Algebras, Graph Algebras and Markov ChainsW*-Corresponcences, Finite Directed Graphs and Markov Chains. W*-Algebras, Graph Algebras and Markov Chains
Victor V. Книга по Требованию  
1980 руб
Rule Learning in Second Language. The Acquisition of Regular and Irregular Past-Tense Forms by Adult ESL LearnersRule Learning in Second Language. The Acquisition of Regular and Irregular Past-Tense Forms by Adult ESL Learners
The book suggests ways to incorporate these insights concerning cognitive processing into current teaching practices to help adult language learners master certain grammar rules more efficiently. Shoba B. Книга по Требованию  
2768 руб
EYE MOVEMENTS DURING READING OF REGULAR AND PHRASE-SEGMENTED TEXTS. EXPLORING INDIVIDUAL DIFFERENCESEYE MOVEMENTS DURING READING OF REGULAR AND PHRASE-SEGMENTED TEXTS. EXPLORING INDIVIDUAL DIFFERENCES
The effect of individual differences (high- vs. low-performance readers) and text formatting (regular vs. phrase- segmented) was studied by examination of readers’ eye movement patterns. Joel M. Книга по Требованию  
2402 руб
Max-Flow Min-Cut. Reconciling Graph Theory with Linear ProgrammingMax-Flow Min-Cut. Reconciling Graph Theory with Linear Programming
Network ? ow theory constitutes a thoroughly studied mathematical ? eld which is widely applied in practice in areas as diverse as economics, traffic routing, or telecommunication. Timon T. Книга по Требованию  
2402 руб
Algorithms for Streaming Graphs. Approaching Graph Problems with Limited Memory and without Random AccessAlgorithms for Streaming Graphs. Approaching Graph Problems with Limited Memory and without Random Access
These powerful assumptions are put in question by massive graphs that exceed common working memories and that can only be stored on disks or even tapes. Mariano Z. Книга по Требованию  
2361 руб
The Perceived Effectiveness of Distance Learning in Higher Education. 1996-2005The Perceived Effectiveness of Distance Learning in Higher Education. 1996-2005
Individual colleges and universities are considering whether to make substantial investments in this technology. Mike W. Книга по Требованию  
2007 руб
The Human Side of Corporate Relocation Going the Distance.The Human Side of Corporate Relocation Going the Distance.
Focus is on the identification of some of the main components of the relocation process and the mechanisms that link these components sequentially. Книга по Требованию  
3233 руб
Spectral Graph Drawing. A SurveySpectral Graph Drawing. A Survey
Graph layouts of several graph-related matrices, such as the adjacency or the Laplace matrix, are studied. Книга по Требованию  
2007 руб
New Research Directions and Some Results A Graph Theoretic Approach to Heterogeneous Data Clustering.New Research Directions and Some Results A Graph Theoretic Approach to Heterogeneous Data Clustering.
First, we propose a semantic-based hierarchical image clustering framework based on multi-user feedback. Manjeet R. Книга по Требованию  
2415 руб
Michael Ondaatje: An analysis of Ondaatje' s writing techniques against a background of war and Buddhist philosophy Distance, Clarity and Ghosts.Michael Ondaatje: An analysis of Ondaatje' s writing techniques against a background of war and Buddhist philosophy Distance, Clarity and
Michael Ondaatje, a celebrated author and poet, has a distinct writing technique of interest to students of literature as well as writers of fiction. Joan E.v.M. Книга по Требованию  
2415 руб
Cost Sharing and Graph Clustering with Selfish Agents Distributed Competition in Networks.Cost Sharing and Graph Clustering with Selfish Agents Distributed Competition in Networks.
The first part of the book presents a class of games for cost sharing of a set of resources. Книга по Требованию  
2783 руб
THE ROLE OF LIBRARIES IN DISTANCE EDUCATION. A CASE OF ALLAMA IQBAL OPEN UNIVERSITYTHE ROLE OF LIBRARIES IN DISTANCE EDUCATION. A CASE OF ALLAMA IQBAL OPEN UNIVERSITY
The distance education is gaining momentum all over the world. MUHAMMAD A. Книга по Требованию  
2007 руб
Cyclomatic Number of Hypergraphs Chromaticity of Jahnagir Graph: h-Chromaticity of Linear Uniform Hypercycles: Chromatic Polynomials and Chromaticity of Graphs and Hypergraphs.Cyclomatic Number of Hypergraphs Chromaticity of Jahnagir Graph: h-Chromaticity of Linear Uniform Hypercycles: Chromatic Polynomials and Chromaticity of Graphs
Also, we will prove an important result which tells us that the number of cycles of a linear hypergraph is bounded below by its cyclomatic number. Akhlaq B. Книга по Требованию  
2007 руб
Regular Languages, Tree Width, and Courcelle’s Theorem. An IntroductionRegular Languages, Tree Width, and Courcelle’s Theorem. An Introduction
Steffen E. Книга по Требованию  
2007 руб
A Study of Motivational Factors to follow Higher Education by Distance. A Study of Motivational Factors to follow HE through Distance Mode with Reference to Publicly-Funded Education Institutions of MauritiusA Study of Motivational Factors to follow Higher Education by Distance. A Study of Motivational Factors to follow HE through Distance Mode with Reference to
Leena R. Книга по Требованию  
2415 руб
Aircraft Performance Explanation for Takeoff from a High Altitude Airport. Takeoff distance, velocity and time are presented as a function of aircraft weight, and provide a practical basis for other reliable information.Aircraft Performance Explanation for Takeoff from a High Altitude Airport. Takeoff distance, velocity and time are presented as a function of aircraft weight,
Participants provide an unintended and unanticipated zero-rate condition encountered in an aviation operation. Книга по Требованию  
2007 руб
Developing Attributes in Australian Mechanical Engineers. A role based study of Australian mechanical engineer attributes and the technologies used to deliver them through proximal and distance educationDeveloping Attributes in Australian Mechanical Engineers. A role based study of Australian mechanical engineer attributes and the technologies used to deliver
The significance of each attribute in each industry' s core mechanical engineering roles are weighted according to the numbers of mechanical engineers employed in those roles. This is considered in the context of a study of the Clive F. Книга по Требованию  
3233 руб
Distance and Topology. Back to the Roots of Topology with a General Concept of DistanceDistance and Topology. Back to the Roots of Topology with a General Concept of Distance
We close with a short study of distance visualization techniques. Книга по Требованию  
2415 руб
Middle Distance Track EventMiddle Distance Track Event
In the United States, the 3000 m is more common at the high school and collegiate levels (along with the US two mile). Frederic P. M. Книга по Требованию  
1394 руб
Distance Matrices in PhylogenyDistance Matrices in Phylogeny
The distance matrix can come from a number of different sources, including measured distance (for example from immunological studies) or morphometric analysis, various pairwise distance formulae (such as euclidean distance) applied to discrete Pollux E.K. Книга по Требованию  
1394 руб
Hyperfocal DistanceHyperfocal Distance
When the lens is focused at this distance, all objects at distances from half of the hyperfocal distance out to infinity will be acceptably sharp. Definition 2: The hyperfocal distance is the distance beyond which all objects are acceptably sharp, Kristen N.H. Книга по Требованию  
1598 руб
Bogardus Social Distance ScaleBogardus Social Distance Scale
The Bogardus Social Distance Scale is a psychological testing scale created by Emory S. Bogardus to empirically measure people' s willingness to participate in social contacts of varying degrees of closeness with members of diverse social Frederic P. M. Книга по Требованию  
1598 руб
Cosmic Distance LadderCosmic Distance Ladder
Frederic P. M. Книга по Требованию  
1394 руб
Graph of a FunctionGraph of a Function
In particular, if x is a real number, graph means the graphical representation of this collection, in the form of a curve on a Cartesian plane, together with Cartesian axes, etc. Frederic P. M. Книга по Требованию  
1394 руб
King's GraphKing's Graph
In graph theory, a king' s graph is a graph that represents all legal moves of the king chess piece on a chessboard where each vertex represents a square on a chessboard and each edge is a legal move. More specifically, an n times m king' Frederic P. M. Книга по Требованию  
1394 руб
Bhattacharyya DistanceBhattacharyya Distance
It is closely related to the Bhattacharyya coefficient which is a measure of the amount of overlap between two statistical samples or populations. Frederic P. M. Книга по Требованию  
1190 руб
Minimum Orbit Intersection DistanceMinimum Orbit Intersection Distance
Minimum orbit intersection distance, abbreviated MOID, is a measure used in astronomy to assess collision risk between astronomical objects. Frederic P. M. Книга по Требованию  
1394 руб
Regular ExpressionsRegular Expressions
A regular expression is written in a formal language that can be interpreted by a regular expression processor, a program that either serves as a parser generator or examines text and identifies parts that match the provided Lambert M. S. Книга по Требованию  
1598 руб
Symmetric GraphSymmetric Graph
However, an edge-transitive graph need not be symmetric, since a—b might map to c—d, but not to d—c. Lambert M. S. Книга по Требованию  
1394 руб
Pumping Lemma for Regular LanguagesPumping Lemma for Regular Languages
High Quality Content by WIKIPEDIA articles! Lambert M. S. Книга по Требованию  
1184 руб
Regular PrimeRegular Prime
High Quality Content by WIKIPEDIA articles! Lambert M. S. Книга по Требованию  
1386 руб
With English exercises for translation and oral exercises for practice in speaking. Questions on grammar, with references . . . Paradigms of verbs, regular and irregular An analytical French reader.With English exercises for translation and oral exercises for practice in speaking. Questions on grammar, with references . . . Paradigms of verbs, regular and
Keetels J.G. Книга по Требованию  
1146 руб
Review and meta-analysis of drugs in intermittent claudicatio and a RCT with caffeine to improve walking distance Therapies for improving walking distance in intermittent claudicatio.Review and meta-analysis of drugs in intermittent claudicatio and a RCT with caffeine to improve walking distance Therapies for improving walking distance in
Anne-Mette H.M. Книга по Требованию  
1877 руб
Open and Distance Learning in Kenya's Public Universities. The Status and Challenges of Open and Distance Learning in Kenya's Public UniversitiesOpen and Distance Learning in Kenya's Public Universities. The Status and Challenges of Open and Distance Learning in Kenya's Public
The focus of this study was on ODL delivery models in Kenya, training and motivation of staff, cost and consistency of the programmes delivery across geographical locations, learner' s interaction with facilitators and feedback. Various Jackline N. Книга по Требованию  
2313 руб
List Of Regular Lodges F.List Of Regular Lodges F.
Книга по Требованию  
603 руб
Scene GraphScene Graph
Examples of such programs include AutoCAD, Adobe Illustrator, Acrobat 3D, X3D, VRML97, OpenSceneGraph, OpenSG, and CorelDRAW. Lambert M. S. Книга по Требованию  
1314 руб
Graph-Structured StackGraph-Structured Stack
In computer science, a graph-structured stack is a directed acyclic graph where each directed path represents a stack. Lambert M. S. Книга по Требованию  
1314 руб
An Exploration In The Management Of Video Distance Learning An Exploration In The Management Of Video Distance Learning (VDL) CLASSROOMS WITHOUT WALLS.
Partnerships between the federal government, the military, corporations and foundations play an increasingly significant role in educational technology and educational reform. Todd A. P. Книга по Требованию  
3050 руб
Software Architecture Recovery based on Pattern Matching Techniques. Using Query-based Graph Pattern Matching to Map Abstract Components and Connectors of a Software System with Entity-Relation Graph of its Source CodeSoftware Architecture Recovery based on Pattern Matching Techniques. Using Query-based Graph Pattern Matching to Map Abstract Components and Connectors of a
This query is mapped onto a pattern-graph, where a component and its constrained interactions with other components are represented as a group of graph-nodes and a group of graph-edges. Kamran S. Книга по Требованию  
3050 руб


на главную


+7 (495) 105-96-52

Киниги почтой www.bookin.org.ru Книжный интернет магазин bookin.org.ru доставка книг почтой