Computer Science
Data Structure
100%
Planar Graph
45%
Subgraphs
14%
Approximation (Algorithm)
11%
bipartite matching
11%
Greedy Algorithm
11%
String Pattern
11%
Clustering Technique
11%
Skeletonization
11%
Minimal Distance
11%
Pattern Matching
11%
Point Cloud
11%
Efficient Algorithm
9%
Augmenting Path
9%
Randomized Algorithm
8%
Answering Query
8%
Spanning Tree
8%
Maximum Matching
7%
Perfect Matchings
6%
Data Type
5%
Betweenness
5%
Public Repository
5%
Biological Sequence
5%
Open Source Tool
5%
Assignment Problem
5%
Shape Representation
5%
Communication Complexity
5%
Sparsity
5%
Software Application
5%
Cosine Transform
5%
digraph
5%
Hash Function
5%
Construction Algorithm
5%
Intersection Set
5%
Direct Implementation
5%
Compression Technique
5%
Basic Operation
5%
Deterministic Case
5%
Intersection Graph
5%
Surface Reconstruction
5%
Polynomial Time
5%
Connected Graph
5%
Dynamic Time Warping
5%
Mathematics
Edge
41%
Data Structure
35%
Worst Case
28%
Running Time
15%
Planar Graph
14%
Linear Time
14%
Unit Speed
11%
Integer
11%
Arboricity
11%
Planarity
11%
Edge-Connectivity
11%
Main Result
10%
Dynamic Algorithms
7%
Connected Graph
7%
Exponential Time
6%
Median
5%
Hamiltonian Cycle
5%
Clustering
5%
Dominating Set
5%
Maximum Degree
5%
Cosine Transform
5%
Perfect Matchings
5%
Linear Space
5%
Euclidean Plane
5%
Countable Set
5%
Frchet-Distance
5%
Exponential Growth
5%
Practical Purpose
5%
Unit Costs
5%
Model of Computation
5%
Closed Curve
5%
Optimal Time
5%
Level-of-Detail
5%
Minimality
5%
Free Graph
5%
Total Time
5%
Total Length
5%
Dictionary Compression
5%
Simple Graph
5%
Line Graph
5%
Keyphrases
Online Bipartite Matching
11%
Server Load
11%
Consecutive Occurrences
11%
String Indexing
11%
Query Response Time
9%
Decremental
8%
Multi-connectivity
7%
Reversible Design
5%
Integer Cosine Transform
5%
Cosine Transformation
5%
Planar Embedding
5%
Linkable
5%
Power of Two Choices
5%
K-partition
5%
Minimum Spanning Forest
5%
Graph Reconstruction
5%
Incident Edges
5%
Shortest Augmenting Path
5%
Subquadratic Space
5%
Number of Vertices
5%
Near-triangulations
5%
Pre-split
5%
Triconnectivity
5%
Tree Embedding
5%
Skeletonization
5%
Bipartition
5%
Time Algorithm
5%
Infinitude
5%
Top Trees
5%
Communication Complexity
5%
Separator
5%
Log-log
5%
Edge Deletion
5%
SPQR-trees
5%
Ende
5%
Longest Common Prefix
5%
Lyndon Array
5%
Compressed Communication
5%
Planarity Testing
5%
Edge Insertion
5%
Fully Dynamic Algorithm
5%
Upward Planar Graphs
5%
Upward Planar
5%
Nearly-linear Time
5%
Edge-connectivity Augmentation
5%
Dynamic Time Warping Distance
5%
Dynamic Time Warping
5%
Supergraph
5%
Parity Constraints
5%
Update Time
5%
