По вашему запросу найдено документов: 3912
Страница 1 из 392
Графовая модель конфликтного взаимодействия транспортных средств на различных перекресткахGraph Model of Vehicle Conflict Interaction at Various Crossroads
Automorphisms of distance regular graphsin which the neighborhoods of the verticesare strongly regular graphs: Reportof Philosophy Doctor Thesis: 01.01.06 — mathematical logic, algebra and theory ofnumbers regular graphs: Reportof Philosophy Doctor Thesis: 01.01.06 — mathematical logic, algebra and theory
Minimization of Boolean functions in the class of orthogonal disjunctive normal forms Boolean function is suggested. The means of graph theory are used in the approach. Two methods to obtain
Parity in knot theory and graph-links knot theory constructed by means of intersection graphs. Parity theory discovered by the second
On Distance-Regular Graphs with = 2V.P.Burichenko and A.A.Makhnev have found intersection arrays of distance-regular graphs with = 2
Automorphisms of the AT4(6; 6; 3)-graph and its Strongly-regular Graphs these
graphs available graph with intersection array f288; 245; 48; 1; 1; 24; 245; 288g on v = 1 + 288 + 2940
Математическая модель и алгоритм автоматизации проектирования многоуровневых сетевых развязок for minimizing intersections. The model is based on the theory of obtaining a planar graph and proof of planarity
Approaches to Automated Traffic Optimal Control System, where nodes correspond to road sections and edges correspond to manoeuvres at intersections. The graph
Control synthesis for traffic simulation in the urban road network lights at intersections is considered. The mathematical model of traffic control is given. To describe
Страница 1 из 392
Фасеты
Партнеры
Индексация
