Skip to main navigation
Skip to search
Skip to main content
Penn State Home
Help & FAQ
Home
Researchers
Research output
Research units
Equipment
Grants & Projects
Prizes
Activities
Search by expertise, name or affiliation
Faster computation of path-width
Martin Fürer
Eberly College of Science
Research output
:
Chapter in Book/Report/Conference proceeding
›
Conference contribution
11
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Faster computation of path-width'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Path Length
100%
Fast Computation
100%
Treewidth
33%
NP-hard Problem
16%
Linear-time Algorithm
16%
Classical Algorithm
16%
Bounded Treewidth
16%
Mathematics
Running Time
33%
Linear Time
16%
Constant Factor
16%
NP-hard Problem
16%
Optimal Path
16%