ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
14
views
44
references
Top references
cited by
35
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,962
similar
All similar
Record
: found
Abstract
: not found
Article
: not found
The NP-completeness column: an ongoing guide
Author(s):
David S Johnson
Publication date
Created:
September 1985
Publication date
(Print):
September 1985
Journal:
Journal of Algorithms
Publisher:
Elsevier BV
Read this article at
ScienceOpen
Publisher
Review
Review article
Invite someone to review
Cite as...
There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
ScienceOpen Research
Most cited references
44
Record
: found
Abstract
: not found
Article
: not found
The complexity of computing the permanent
L.G. Valiant
(1979)
0
comments
Cited
450
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
The ellipsoid method and its consequences in combinatorial optimization
M. Grötschel
,
L Lovász
,
A Schrijver
(1981)
0
comments
Cited
262
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
Kellogg S. Booth
,
George S. Lueker
(1976)
0
comments
Cited
192
times
– based on
0
reviews
Review now
Bookmark
All references
Author and article information
Journal
Title:
Journal of Algorithms
Abbreviated Title:
Journal of Algorithms
Publisher:
Elsevier BV
ISSN (Print):
01966774
Publication date Created:
September 1985
Publication date (Print):
September 1985
Volume
: 6
Issue
: 3
Pages
: 434-451
Article
DOI:
10.1016/0196-6774(85)90012-4
SO-VID:
6dedfd3f-a51a-40b9-b4f9-e6a3471498bf
Copyright ©
© 1985
License:
http://www.elsevier.com/tdm/userlicense/1.0/
History
Data availability:
Comments
Comment on this article
Sign in to comment
scite_
Similar content
1,962
Definite NP anaphora and C-command domains
Authors:
T Reinhart
,
Tanya Reinhart
IMpassion130: updated overall survival (OS) from a global, randomized, double-blind, placebo-controlled, Phase III study of atezolizumab (atezo) + nab-paclitaxel (nP) in previously untreated locally advanced or metastatic triple-negative breast cancer (mTNBC).
Authors:
Peter M Schmid
,
Sylvia Adams
,
Hope Rugo
…
Effects of Mn nanoparticle addition on wettability, microstructure and microhardness of low-Ag Sn-0.3Ag-0.7Cu-
x
Mn(np) composite solders
Authors:
Yu Tang
,
Shaoming Luo
,
Guoyuan Li
…
See all similar
Cited by
35
Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
Authors:
Richard Borie
,
R. Parker
,
Craig Tovey
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
Authors:
Hans L. Bodlaender
Domination on Cocomparability Graphs
Authors:
Lorna Stewart
,
Dieter Kratsch
See all cited by
Most referenced authors
182
D Johnson
G Miller
D. D. Johnson
See all reference authors