Математика
Contact
89%
Graph in graph theory
82%
Planar graph
74%
Approximation Algorithms
59%
Drawing
56%
Colouring
47%
Crossing Minimization
44%
Unit cube
40%
Rectangle
39%
Line
38%
Routing
35%
Color
35%
NP-complete problem
33%
Hardness
32%
Graph Classes
31%
Profit
28%
Semantics
27%
Bundle
27%
Path
24%
Embedded Graph
23%
Outerplanar Graph
22%
Minimization Problem
20%
Embeddability
20%
Crossing number
19%
Vertex of a graph
19%
Computing
18%
Overlap
17%
Geometric Representation
16%
Point Sets
15%
Approximation
15%
Sparse Graphs
15%
Heuristics
15%
Star
14%
Unit Disk
14%
Maximum Degree
13%
Arc of a curve
13%
NP-completeness
13%
Euclidean
13%
Efficient Algorithms
13%
Permutation
13%
Trajectory
12%
Graph Coloring
12%
Minimise
11%
Unit
11%
Metric
10%
Grid Graph
10%
Motion Tracking
10%
Line segment
10%
Tangles
10%
Технические дисциплины и материаловедение
Approximation algorithms
100%
Coloring
77%
NP-hard
65%
Profitability
43%
Color
40%
Stars
33%
Graph structures
30%
Ink
26%
Hardness
25%
Semantics
22%
Cost functions
14%
Visualization
12%
Trajectories
11%
Labeling
10%
Triangulation
9%
Polynomials
8%
Merging
8%
Motion tracking
6%
Online systems
6%