-
Notifications
You must be signed in to change notification settings - Fork 4
/
GraphTheoryNew.owl
878 lines (584 loc) · 49.9 KB
/
GraphTheoryNew.owl
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
<?xml version="1.0"?>
<!DOCTYPE rdf:RDF [
<!ENTITY foaf "http://xmlns.com/foaf/0.1/" >
<!ENTITY owl "http://www.w3.org/2002/07/owl#" >
<!ENTITY xsd "http://www.w3.org/2001/XMLSchema#" >
<!ENTITY schema "http://purl.org/vocab/aiiso/schema#" >
<!ENTITY rdfs "http://www.w3.org/2000/01/rdf-schema#" >
<!ENTITY rdf "http://www.w3.org/1999/02/22-rdf-syntax-ns#" >
<!ENTITY learning "http://ailab.ifmo.ru/elearning/learning#" >
]>
<rdf:RDF xmlns="http://ailab.ifmo.ru/elearning/GraphTheory#"
xml:base="http://ailab.ifmo.ru/elearning/GraphTheory"
xmlns:schema="http://purl.org/vocab/aiiso/schema#"
xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#"
xmlns:foaf="http://xmlns.com/foaf/0.1/"
xmlns:owl="http://www.w3.org/2002/07/owl#"
xmlns:xsd="http://www.w3.org/2001/XMLSchema#"
xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
xmlns:learning="http://ailab.ifmo.ru/elearning/learning#">
<owl:Ontology rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory">
<owl:imports rdf:resource="http://ailab.ifmo.ru/elearning/learning"/>
<owl:imports rdf:resource="http://xmlns.com/foaf/0.1/"/>
</owl:Ontology>
<!--
///////////////////////////////////////////////////////////////////////////////////////
//
// Individuals
//
///////////////////////////////////////////////////////////////////////////////////////
-->
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#BronKerboshaAlgorithmForFindingTheLargestEmptySubgraphsInAGraph -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#BronKerboshaAlgorithmForFindingTheLargestEmptySubgraphsInAGraph">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">Bron-Kerbosha algorithm for finding the largest empty subgraphs in a graph</rdfs:label>
<rdfs:label xml:lang="ru">Алгоритм Брона-Кербоша для поиска наибольших пустых подграфов в графе</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">34</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_OptimizationOnGraphs"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#TheTheoryOfGraphs -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#TheTheoryOfGraphs">
<rdf:type rdf:resource="http://purl.org/vocab/aiiso/schema#Course"/>
<rdfs:label xml:lang="en">The theory of graphs</rdfs:label>
<rdfs:label xml:lang="ru">Теория графов</rdfs:label>
<foaf:depiction rdf:resource="http://yak15.narod.ru/KenigsG.jpg"/>
<schema:description xml:lang="ru">Целью дисциплины является получение студентами необходимых знаний и пониманий, умений и навыков для решения практических задач дискретной математики, широко используемых при проектировании, внедрении, анализе и сопровождении корпоративных информационных систем.</schema:description>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_ASpanningTreeOfAConnectedGraphTheConceptOfSubgraph -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_ASpanningTreeOfAConnectedGraphTheConceptOfSubgraph">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">A spanning tree of a connected graph, the concept of subgraph</rdfs:label>
<rdfs:label xml:lang="ru">Остовное дерево связного графа, понятие суграфа</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">24</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_Trees"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_AlgorithmsForConstructingASpanningTreeOfTheGraph -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_AlgorithmsForConstructingASpanningTreeOfTheGraph">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">Algorithms for constructing a spanning tree of the graph</rdfs:label>
<rdfs:label xml:lang="ru">Алгоритмы построения остовного дерева графа</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">25</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_Trees"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_BellmanFordAlgorithmForFindingAMinimalPathInAWeightedGraph -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_BellmanFordAlgorithmForFindingAMinimalPathInAWeightedGraph">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">Bellman-Ford algorithm for finding a minimal path in a weighted graph</rdfs:label>
<rdfs:label xml:lang="ru">Алгоритм Форда-Беллмана для поиска минимального маршрута во взвешенном графе</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">13</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_ConnectednessOfGraph"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_BinaryTrees -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_BinaryTrees">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">Binary trees</rdfs:label>
<rdfs:label xml:lang="ru">Двоичные деревья</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">30</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_Trees"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_ClassificationOfGraphsInStructure -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_ClassificationOfGraphsInStructure">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">Classification of graphs in structure</rdfs:label>
<rdfs:label xml:lang="ru">Классификация графов по структуре</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">2</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_FundamentalsOfGraphTheory"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_ClicksNumberOfAGraphTheConceptOfGraphAdditions -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_ClicksNumberOfAGraphTheConceptOfGraphAdditions">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">Clicks number of a graph, the concept of graph - additions</rdfs:label>
<rdfs:label xml:lang="ru">Кликовое число графа, понятие графа-дополнения</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">35</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_OptimizationOnGraphs"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_CoherenceNeografov -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_CoherenceNeografov">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">Coherence neografov</rdfs:label>
<rdfs:label xml:lang="ru">Связность неографов</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">6</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_ConnectednessOfGraph"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_CondensationOfDigraphsTheConceptOfSub-graph -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_CondensationOfDigraphsTheConceptOfSub-graph">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">Condensation of digraphs, the concept of sub-graph</rdfs:label>
<rdfs:label xml:lang="ru">Конденсирование орграфов, понятие подграфа</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">10</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_ConnectednessOfGraph"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_ConnectednessOfDigraphs -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_ConnectednessOfDigraphs">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">Connectedness of digraphs</rdfs:label>
<rdfs:label xml:lang="ru">Связность орграфов</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">8</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_ConnectednessOfGraph"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_ConsequencesOfEulersTheorem -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_ConsequencesOfEulersTheorem">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">Consequences of Euler's theorem</rdfs:label>
<rdfs:label xml:lang="ru">Следствия из теоремы Эйлера</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">51</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_FlatAndPlanarGraphs"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_CountTheNumberOfEdgeCovering -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_CountTheNumberOfEdgeCovering">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">Count the number of edge covering</rdfs:label>
<rdfs:label xml:lang="ru">Число реберного покрытия графа</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">42</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_OptimizationOnGraphs"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_CountTheNumberOfExternalStability -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_CountTheNumberOfExternalStability">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">Count the number of external stability</rdfs:label>
<rdfs:label xml:lang="ru">Число внешней устойчивости графа</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">40</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_OptimizationOnGraphs"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_CountTheNumberOfInternalStability -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_CountTheNumberOfInternalStability">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">Count the number of internal stability</rdfs:label>
<rdfs:label xml:lang="ru">Число внутренней устойчивости графа</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">32</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_OptimizationOnGraphs"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_CountTheNumberOfMatchings -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_CountTheNumberOfMatchings">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">Count the number of matchings</rdfs:label>
<rdfs:label xml:lang="ru">Число паросочетания графа</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">41</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_OptimizationOnGraphs"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_CyclesInDigraphs -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_CyclesInDigraphs">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">Cycles in digraphs</rdfs:label>
<rdfs:label xml:lang="ru">Циклы в орграфах</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">16</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_CyclesInGraphs"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_CyclesInNeografah -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_CyclesInNeografah">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">Cycles in neografah</rdfs:label>
<rdfs:label xml:lang="ru">Циклы в неографах</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">15</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_CyclesInGraphs"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_EulerCycles -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_EulerCycles">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">Euler cycles</rdfs:label>
<rdfs:label xml:lang="ru">Циклы Эйлера</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">18</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_CyclesInGraphs"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_EulersTheoremEulersFormulaForAPlanarGraph -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_EulersTheoremEulersFormulaForAPlanarGraph">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">Euler's theorem (= Euler's formula) for a planar graph</rdfs:label>
<rdfs:label xml:lang="ru">Теорема Эйлера (=формула Эйлера) для плоского графа</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">50</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_FlatAndPlanarGraphs"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_HamiltonCycles -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_HamiltonCycles">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">Hamilton cycles</rdfs:label>
<rdfs:label xml:lang="ru">Циклы Гамильтона</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">19</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_CyclesInGraphs"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_HeuristicAlgorithmToSolveTheTravelingSalesmanProblemOnTheBasisOfTheMaximin -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_HeuristicAlgorithmToSolveTheTravelingSalesmanProblemOnTheBasisOfTheMaximin">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">Heuristic algorithm to solve the traveling salesman problem on the basis of the maximin</rdfs:label>
<rdfs:label xml:lang="ru">Эвристический алгоритм решения задача коммивояжера на основе метода максимина</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">22</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_CyclesInGraphs"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_HeuristicMinimumGraphColoring -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_HeuristicMinimumGraphColoring">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">Heuristic minimum graph coloring</rdfs:label>
<rdfs:label xml:lang="ru">Эвристический алгоритм минимальной раскраски графа</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">39</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_OptimizationOnGraphs"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_HungarianAlgorithm -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_HungarianAlgorithm">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">Hungarian algorithm</rdfs:label>
<rdfs:label xml:lang="ru">Венгерский алгоритм</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">45</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_BipartiteGraphs"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_IndependentCyclesInAGraph -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_IndependentCyclesInAGraph">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">Independent cycles in a graph</rdfs:label>
<rdfs:label xml:lang="ru">Независимые циклы в графе</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">17</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_CyclesInGraphs"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_KruskalsAlgorithm -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_KruskalsAlgorithm">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">Kruskal's algorithm</rdfs:label>
<rdfs:label xml:lang="ru">Алгоритм Краскала</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">28</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_Trees"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_MetricCharacteristicsOfAConnectedGraph -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_MetricCharacteristicsOfAConnectedGraph">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">Metric characteristics of a connected graph</rdfs:label>
<rdfs:label xml:lang="ru">Метрические характеристики связного графа</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">14</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_ConnectednessOfGraph"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_MinimumGraphColoringAlgorithmBasedOnTheMethodMagoo -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_MinimumGraphColoringAlgorithmBasedOnTheMethodMagoo">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">Minimum graph coloring algorithm based on the method Magoo</rdfs:label>
<rdfs:label xml:lang="ru">Алгоритм минимальной раскраски графа на основе метода Магу</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">38</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_OptimizationOnGraphs"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_MinimumRoutesInAConnectedGraph -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_MinimumRoutesInAConnectedGraph">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">Minimum routes in a connected graph</rdfs:label>
<rdfs:label xml:lang="ru">Минимальные маршруты в связном графе</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">11</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_ConnectednessOfGraph"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_OperationsOnGraphs -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_OperationsOnGraphs">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">Operations on graphs</rdfs:label>
<rdfs:label xml:lang="ru">Операции над графами</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">5</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_FundamentalsOfGraphTheory"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_PontryaginKuratowskiTheorem -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_PontryaginKuratowskiTheorem">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">Pontryagin-Kuratowski theorem</rdfs:label>
<rdfs:label xml:lang="ru">Теорема Понтрягина-Куратовского</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">52</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_FlatAndPlanarGraphs"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_PrimaTheoremOnTheMinimumSpanningTree -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_PrimaTheoremOnTheMinimumSpanningTree">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">Prima theorem on the minimum spanning tree</rdfs:label>
<rdfs:label xml:lang="ru">Теорема Прима о минимальном остовном дереве графа</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">26</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_Trees"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_PrimsAlgorithm -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_PrimsAlgorithm">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">Prim's algorithm</rdfs:label>
<rdfs:label xml:lang="ru">Алгоритм Прима</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">27</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_Trees"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_RootedTrees -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_RootedTrees">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">Rooted trees</rdfs:label>
<rdfs:label xml:lang="ru">Корневые деревья</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">29</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_Trees"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_SeparatingSetOfAConnectedGraph -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_SeparatingSetOfAConnectedGraph">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">Separating set of a connected graph</rdfs:label>
<rdfs:label xml:lang="ru">Разделяющее множество связного графа</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">7</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_ConnectednessOfGraph"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_TechniqueToStudyTheGraph -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_TechniqueToStudyTheGraph">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">Technique to study the graph</rdfs:label>
<rdfs:label xml:lang="ru">Методика исследования связности графа</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">9</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_ConnectednessOfGraph"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_TheAlgorithmEstablishTheIsomorphismOfTwoGraphsBasedOnTheCharacteristicsOfVertices -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_TheAlgorithmEstablishTheIsomorphismOfTwoGraphsBasedOnTheCharacteristicsOfVertices">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">The algorithm establish the isomorphism of two graphs based on the characteristics of vertices</rdfs:label>
<rdfs:label xml:lang="ru">Алгоритм установления изоморфизма двух графов на основе характеристик вершин графа</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">48</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_IsomorphismOfGraphsAndAHomeomorphism"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_TheAlgorithmForSolvingTheTravelingSalesmanProblemBasedOnTheBranchAndBound -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_TheAlgorithmForSolvingTheTravelingSalesmanProblemBasedOnTheBranchAndBound">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">The algorithm for solving the traveling salesman problem based on the branch and bound</rdfs:label>
<rdfs:label xml:lang="ru">Алгоритм решения задача коммивояжера на основе метода ветвей и границ</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">21</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_CyclesInGraphs"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_TheAlgorithmMagooWeismannToFindTheBiggestEmptySubgraphsInAGraph -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_TheAlgorithmMagooWeismannToFindTheBiggestEmptySubgraphsInAGraph">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">The algorithm Magoo-Weismann to find the biggest empty subgraphs in a graph</rdfs:label>
<rdfs:label xml:lang="ru">Алгоритм Магу-Вейсмана для поиска наибольших пустых подграфов в графе</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">33</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_OptimizationOnGraphs"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_TheAlgorithmMagooWeismannToFindTheLargestCompleteSubgraphsInAGraph -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_TheAlgorithmMagooWeismannToFindTheLargestCompleteSubgraphsInAGraph">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">The algorithm Magoo - Weismann to find the largest complete subgraphs in a graph</rdfs:label>
<rdfs:label xml:lang="ru">Алгоритм Магу-Вейсмана для поиска наибольших полных подграфов в графе</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">36</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_OptimizationOnGraphs"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_TheAlgorithmRobertsFloresSearchForHamiltonCyclesInAGraph -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_TheAlgorithmRobertsFloresSearchForHamiltonCyclesInAGraph">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">The algorithm Roberts -Flores Search for Hamilton cycles in a graph</rdfs:label>
<rdfs:label xml:lang="ru">Алгоритм Робертса-Флореса для поиска циклов Гамильтона в графе</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">20</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_CyclesInGraphs"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_TheChromaticNumberOfAGraph -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_TheChromaticNumberOfAGraph">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">The chromatic number of a graph</rdfs:label>
<rdfs:label xml:lang="ru">Хроматическое число графа</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">37</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_OptimizationOnGraphs"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_TheConceptOfATreeWoodsTreesProperties -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_TheConceptOfATreeWoodsTreesProperties">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">The concept of a tree, woods, trees, properties</rdfs:label>
<rdfs:label xml:lang="ru">Понятие дерева, леса, свойства деревьев</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">23</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_Trees"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_TheConceptOfExtremeNumberOfTheGraphTheCyclomaticNumberOfAGraph -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_TheConceptOfExtremeNumberOfTheGraphTheCyclomaticNumberOfAGraph">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">The concept of extreme number of the graph , the cyclomatic number of a graph</rdfs:label>
<rdfs:label xml:lang="ru">Понятие экстремального числа графа, цикломатическое число графа</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">31</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_OptimizationOnGraphs"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_TheConceptOfFlatAndPlanarGraphTheGraphPropertiesOfPlanePilings -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_TheConceptOfFlatAndPlanarGraphTheGraphPropertiesOfPlanePilings">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">The concept of flat and planar graph, the graph properties of plane pilings</rdfs:label>
<rdfs:label xml:lang="ru">Понятие плоского и планарного графа, свойства плоских укладок графа</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">49</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_FlatAndPlanarGraphs"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_TheConceptOfHomeomorphism -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_TheConceptOfHomeomorphism">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">The concept of homeomorphism</rdfs:label>
<rdfs:label xml:lang="ru">Понятие гомеоморфизма</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">47</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_IsomorphismOfGraphsAndAHomeomorphism"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_TheConceptOfIsomorphismTheNecessaryConditionsForTheIsomorphismOfTwoGraphs -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_TheConceptOfIsomorphismTheNecessaryConditionsForTheIsomorphismOfTwoGraphs">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">The concept of isomorphism, the necessary conditions for the isomorphism of two graphs</rdfs:label>
<rdfs:label xml:lang="ru">Понятие изоморфизма, необходимые условия изоморфизма двух графов</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">46</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_IsomorphismOfGraphsAndAHomeomorphism"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_TheContiguityInGraphs -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_TheContiguityInGraphs">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">The contiguity in graphs</rdfs:label>
<rdfs:label xml:lang="ru">Смежность в графах</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">4</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_FundamentalsOfGraphTheory"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_TheHistoryOfGraphTheoryTheNotionOfAGraph -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_TheHistoryOfGraphTheoryTheNotionOfAGraph">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">The history of graph theory, the notion of a graph</rdfs:label>
<rdfs:label xml:lang="ru">История теории графов, понятие графа</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">1</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_FundamentalsOfGraphTheory"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_TheMainBasisOfTheGraphTheoryTerminology -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_TheMainBasisOfTheGraphTheoryTerminology">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">The main basis of the graph theory terminology</rdfs:label>
<rdfs:label xml:lang="ru">Основной терминологический базис теории графов</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">3</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_FundamentalsOfGraphTheory"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_TheNotionOfABipartiteGraphTheoremKoenig -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_TheNotionOfABipartiteGraphTheoremKoenig">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">The notion of a bipartite graph, Theorem Koenig</rdfs:label>
<rdfs:label xml:lang="ru">Понятие двудольного графа, теорема Кёнига</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">43</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_BipartiteGraphs"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_TheProblemOfLinearPurposeTheNotionOfAPerfectMatchingOfTheGraph -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_TheProblemOfLinearPurposeTheNotionOfAPerfectMatchingOfTheGraph">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">The problem of linear purpose, the notion of a perfect matching of the graph</rdfs:label>
<rdfs:label xml:lang="ru">Задача линейного назначения, понятие совершенного паросочетания графа</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">44</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_BipartiteGraphs"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_WaveAlgorithmForFindingAMinimumAlongTheRoute -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_WaveAlgorithmForFindingAMinimumAlongTheRoute">
<rdf:type rdf:resource="&learning;Lecture"/>
<rdfs:label xml:lang="en">Wave algorithm for finding a minimum along the route</rdfs:label>
<rdfs:label xml:lang="ru">Волновой алгоритм для поиска минимального по длине маршрута</rdfs:label>
<learning:numberOfLecture rdf:datatype="&xsd;integer">12</learning:numberOfLecture>
<learning:isLectureOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#m_ConnectednessOfGraph"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#m_BipartiteGraphs -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#m_BipartiteGraphs">
<rdf:type rdf:resource="http://purl.org/vocab/aiiso/schema#Module"/>
<rdfs:label xml:lang="en">Bipartite graphs</rdfs:label>
<rdfs:label xml:lang="ru">Двудольные графы</rdfs:label>
<learning:numberOfModule rdf:datatype="&xsd;integer">6</learning:numberOfModule>
<learning:isModuleOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#TheTheoryOfGraphs"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#m_ConnectednessOfGraph -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#m_ConnectednessOfGraph">
<rdf:type rdf:resource="http://purl.org/vocab/aiiso/schema#Module"/>
<rdfs:label xml:lang="en">Connectedness of graph</rdfs:label>
<rdfs:label xml:lang="ru">Связность графов</rdfs:label>
<learning:numberOfModule rdf:datatype="&xsd;integer">2</learning:numberOfModule>
<learning:isModuleOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#TheTheoryOfGraphs"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#m_CyclesInGraphs -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#m_CyclesInGraphs">
<rdf:type rdf:resource="http://purl.org/vocab/aiiso/schema#Module"/>
<rdfs:label xml:lang="en">Cycles in graphs</rdfs:label>
<rdfs:label xml:lang="ru">Циклы в графах</rdfs:label>
<learning:numberOfModule rdf:datatype="&xsd;integer">3</learning:numberOfModule>
<learning:isModuleOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#TheTheoryOfGraphs"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#m_FlatAndPlanarGraphs -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#m_FlatAndPlanarGraphs">
<rdf:type rdf:resource="http://purl.org/vocab/aiiso/schema#Module"/>
<rdfs:label xml:lang="en">Flat and planar graphs</rdfs:label>
<rdfs:label xml:lang="ru">Плоские и планарные графы</rdfs:label>
<learning:numberOfModule rdf:datatype="&xsd;integer">8</learning:numberOfModule>
<learning:isModuleOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#TheTheoryOfGraphs"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#m_FundamentalsOfGraphTheory -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#m_FundamentalsOfGraphTheory">
<rdf:type rdf:resource="http://purl.org/vocab/aiiso/schema#Module"/>
<rdfs:label xml:lang="en">Fundamentals of graph theory</rdfs:label>
<rdfs:label xml:lang="ru">Основы теории графов</rdfs:label>
<learning:numberOfModule rdf:datatype="&xsd;integer">1</learning:numberOfModule>
<learning:isModuleOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#TheTheoryOfGraphs"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#m_IsomorphismOfGraphsAndAHomeomorphism -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#m_IsomorphismOfGraphsAndAHomeomorphism">
<rdf:type rdf:resource="http://purl.org/vocab/aiiso/schema#Module"/>
<rdfs:label xml:lang="en">Isomorphism of graphs and a homeomorphism</rdfs:label>
<rdfs:label xml:lang="ru">Изоморфизм и гомеоморфизм графов</rdfs:label>
<learning:numberOfModule rdf:datatype="&xsd;integer">7</learning:numberOfModule>
<learning:isModuleOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#TheTheoryOfGraphs"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#m_OptimizationOnGraphs -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#m_OptimizationOnGraphs">
<rdf:type rdf:resource="http://purl.org/vocab/aiiso/schema#Module"/>
<rdfs:label xml:lang="en">Optimization on graphs</rdfs:label>
<rdfs:label xml:lang="ru">Оптимизация на графах</rdfs:label>
<learning:numberOfModule rdf:datatype="&xsd;integer">5</learning:numberOfModule>
<learning:isModuleOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#TheTheoryOfGraphs"/>
</owl:NamedIndividual>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#m_Trees -->
<owl:NamedIndividual rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#m_Trees">
<rdf:type rdf:resource="http://purl.org/vocab/aiiso/schema#Module"/>
<rdfs:label xml:lang="en">Trees</rdfs:label>
<rdfs:label xml:lang="ru">Деревья</rdfs:label>
<learning:numberOfModule rdf:datatype="&xsd;integer">4</learning:numberOfModule>
<learning:isModuleOf rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#TheTheoryOfGraphs"/>
</owl:NamedIndividual>
<!--////////////////////////////////////////////////////////////// -->
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_ClassificationOfGraphsInStructure -->
<rdf:Description rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_ClassificationOfGraphsInStructure">
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#l_ClassificationOfGraphsInStructure"/>
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_Edge"/>
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_Loop"/>
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_TheOriginOfTheTermGraph"/>
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_Top"/>
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_Tree"/>
</rdf:Description>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_CyclesInDigraphs -->
<rdf:Description rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_CyclesInDigraphs">
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_Cycle"/>
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_TheCycleLength"/>
</rdf:Description>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_CyclesInNeografah -->
<rdf:Description rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_CyclesInNeografah">
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_ASimpleLoop"/>
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_CountEuler"/>
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_Cycle"/>
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_GraphHamilton"/>
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_TheCycleLength"/>
</rdf:Description>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_EulerCycles -->
<rdf:Description rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_EulerCycles">
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_Cycle"/>
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_TheCycleLength"/>
</rdf:Description>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_HamiltonCycles -->
<rdf:Description rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_HamiltonCycles">
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_Cycle"/>
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_TheCycleLength"/>
</rdf:Description>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_MinimumRoutesInAConnectedGraph -->
<rdf:Description rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_MinimumRoutesInAConnectedGraph">
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_Arc"/>
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_EmptyGraph"/>
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_EndOfRoute"/>
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_FullCount"/>
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_LengthBasedRoute"/>
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_LengthOfTheRoute"/>
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_Route"/>
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_SaturatedGraph"/>
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_TheRouteStarts"/>
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_Top"/>
</rdf:Description>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_OperationsOnGraphs -->
<rdf:Description rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_OperationsOnGraphs">
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_Arc"/>
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_EmptyGraph"/>
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_FullCount"/>
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_SaturatedGraph"/>
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_Top"/>
</rdf:Description>
<!-- http://ailab.ifmo.ru/elearning/GraphTheory#l_TheMainBasisOfTheGraphTheoryTerminology -->
<rdf:Description rdf:about="http://ailab.ifmo.ru/elearning/GraphTheory#l_TheMainBasisOfTheGraphTheoryTerminology">
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_Arc"/>
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_IndegreeTop"/>
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_OutdegreeTop"/>
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_StokeArc"/>
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_TheIncidenceMatrix"/>
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_TheSourceOfTheArc"/>
<learning:hasTerm rdf:resource="http://ailab.ifmo.ru/elearning/GraphTheory#t_TheWeightMatrix"/>
</rdf:Description>
</rdf:RDF>
<!-- Generated by the OWL API (version 3.4.2) http://owlapi.sourceforge.net -->