The lexicographically first maximal subgraph problems:P-completeness andNC algorithms

This publication has 28 references indexed in Scilit:

• Parallelism and the maximal path problem
  Information Processing Letters, 1987
• A taxonomy of problems with fast parallel algorithms
  Information and Control, 1985
• The Nielsen reduction and P-complete problems in free groups
  Theoretical Computer Science, 1984
• Edge-deletion and edge-contraction problems
  Published by Association for Computing Machinery (ACM) ,1982
• Linear programming is log-space hard for P
  Information Processing Letters, 1979
• The monotone and planar circuit value problems are log space complete for P
  ACM SIGACT News, 1977
• The Rectilinear Steiner Tree Problem is $NP$-Complete
  SIAM Journal on Applied Mathematics, 1977
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
  Journal of Computer and System Sciences, 1976
• An observation on time-storage trade off
  Journal of Computer and System Sciences, 1974
• Efficient Planarity Testing
  Journal of the ACM, 1974