Opening book details…
About this Computer Science article
An Algorithm for Finding a Forest in a Planar Graph-case in Which a Net May Have Terminals on the Two Specified Face Boundaries by Hitoshi Suzuki; Takehiro Akama; Takao Nishizeki is a Computer Science article available to read on EtoBox.
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Hitoshi Suzuki; Takehiro Akama; Takao Nishizeki
- Publisher
- John Wiley and Sons; Wiley (John Wiley & Sons); John Wiley & Sons Inc.; Wiley (ISSN 1042-0967)
- Published
- 1989
- Language
- EN
- Field
- Computer Science (Physical Sciences)
More by Hitoshi Suzuki; Takehiro Akama; Takao Nishizeki
Browse all works by Hitoshi Suzuki; Takehiro Akama; Takao Nishizeki