Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research units
Facilities
Projects
Research output
Search by expertise, name or affiliation
Hardness of edge-modification problems
Noga Alon
, Uri Stav
Research output
:
Contribution to journal
›
Article
›
peer-review
10
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Hardness of edge-modification problems'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Hardness
100%
Graph in graph theory
45%
Deletion
34%
Edit Distance
30%
Approximation
27%
Monotone
26%
Family
20%
NP-complete problem
17%
Hereditary Properties
14%
Closed
12%
Approximability
12%
Computational Complexity
10%
Polynomial-time Algorithm
9%
Approximation Algorithms
9%
Efficient Algorithms
9%
Computing
6%
Context
6%
Vertex of a graph
6%
Engineering & Materials Science
Hardness
78%
NP-hard
64%
Approximation algorithms
35%
Computational complexity
26%
Polynomials
25%