Skip to main navigation
Skip to search
Skip to main content
University of Illinois Urbana-Champaign 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
Computer 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
Mathematics
Subgraph
64%
Connected graph
62%
Costs
56%
Undirected Graph
24%
Vertex of a graph
22%
Approximation
19%
Bicriteria
17%
Approximation Algorithms
11%
Term
6%
Integer
6%
Graph in graph theory
5%
Engineering & Materials Science
Costs
29%
Approximation algorithms
12%