Skip to main navigation
Skip to search
Skip to main content
Northwestern Scholars Home
Help & FAQ
Home
Experts
Organizations
Research Output
Grants
Core Facilities
Search by expertise, name or affiliation
Extending planar graph algorithms to K
3,3
-free graphs
Samir Khuller
*
*
Corresponding author for this work
Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
7
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Extending planar graph algorithms to K
3,3
-free graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Graph Algorithms
100%
Planar graph
69%
Graph in graph theory
34%
Depth-first Search
27%
Maximal Independent Set
24%
Planarity
23%
Graph Coloring
22%
Parallel Algorithms
21%
Efficient Algorithms
16%
Corollary
14%
Restriction
12%
Class
5%
Engineering & Materials Science
Graph algorithms
95%
Coloring
44%
Parallel algorithms
35%