Abstract
Some graph theoretic problems are considered and these problems are provided to be complete for nondeterministic log-space. These graph problems concern matching, connectivity, feedback node set, diameter, radius and so on. A consideration is also made in connection with the Jones' open problem.
Original language | English |
---|---|
Pages (from-to) | 102-107 |
Number of pages | 6 |
Journal | Transactions of the Institute of Electronics and Communication Engineers of Japan. Section E |
Volume | E66 |
Issue number | 2 |
Publication status | Published - 1983 Jan 1 |
Externally published | Yes |
ASJC Scopus subject areas
- Engineering(all)