ΔP2-complete lexicographically first maximal subgraph problems☆
Under an Elsevier user license
open archive
Cited by (0)
- ☆
This work was first presented at the Thirteenth Symposium on Mathematical Foundations of Computer Science (MFCS '88), Carlsbad, Czechoslovakia, 1988 and selected for publication in Theoretical Computer Science by M. Chytil.
Copyright © 1991 Published by Elsevier B.V.