Satoru Miyano. The Lexicographically First Maximal Subgraph Problems: P-Completeness and NC Algorithms. In Thomas Ottmann, editor, Automata, Languages and Programming, 14th International Colloquium, ICALP87, Karlsruhe, Germany, July 13-17, 1987, Proceedings. Volume 267 of Lecture Notes in Computer Science, pages 425-434, Springer, 1987.
Abstract is missing.