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
Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
Noga Alon
, Shai Gutner
Research output
:
Contribution to journal
›
Article
›
peer-review
54
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Linear time algorithms for finding a dominating set of fixed size in degenerated graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Linear-time Algorithm
100%
Dominating Set
96%
Graph in graph theory
43%
Minor
29%
Fixed-parameter Algorithms
27%
Cycle
22%
Family
14%
Planar graph
9%
Engineering & Materials Science
Set theory
61%