Showing papers by "Satoru Miyano published in 1987"
13 Jul 1987
TL;DR: The main contribution of this paper is theP-completeness of the lfm subgraph problem for any nontrivial hereditary property and it is shown that the lfmedge-induced sub graph problem for some graph properties and show that it has a different complexity feature.
Abstract: The P-completeness of the lexicographically first maximal (l.f.m.) subgraph problem for any nontrivial hereditary property is proved. If the instances are restricted to graphs with degree at most 3, the l.f.m. 4-cycle free subgraph problem is shown to be in NC2. This degree constraint 3 is best possible.
32 citations