Deciding whether graph G has page number one is in NC: Deciding whether graph \(G\) has page number one is in NC

Authors: Shigeru Masuyama, Shozo Naito

Source: Information Processing Letters. 44:7-10

Subject Terms: class NC, page number one, Analysis of algorithms and problem complexity, Graph theory (including graph drawing) in computer science, 4. Education, parallel graph algorithm, Distributed algorithms, 0102 computer and information sciences, forbidden subgraph, 01 natural sciences, 7. Clean energy, polylog time algorithm

File Description: application/xml

Access URL: http://www.kurims.kyoto-u.ac.jp/~kyodo/kokyuroku/contents/pdf/0790-22.pdf