Skip to main navigation
Skip to search
Skip to main content
Illinois Experts Home
LOGIN & Help
Home
Profiles
Research units
Research & Scholarship
Datasets
Honors
Press/Media
Activities
Search by expertise, name or affiliation
Pruning 2-connected graphs
Chandra Chekuri
, Nitish Korula
Siebel School of Computing and Data Science
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Pruning 2-connected graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Pruning
100%
2-connected Graphs
100%
Connected Subgraphs
100%
Undirected Graph
50%
2-connected
50%
NP-hard Problem
25%
Approximation Algorithms
25%
Log 2
25%
Pruning Strategy
25%
Number of Vertices
25%
Minimum Cost
25%
Small Additives
25%
Bicriteria Approximation
25%
Computer Science
Connected Graph
100%
Connected Subgraph
100%
Approximation (Algorithm)
75%
Subgraphs
50%
Directed Graphs
50%
Approximation Algorithms
25%
Mathematics
Edge
100%
Connected Graph
100%
Integer
25%
NP-hard Problem
25%
Bicriteria
25%