An algorithm for finding a forest in a planar graph-case in which a net may have terminals on the two specified face boundaries

✍ Scribed by Hitoshi Suzuki; Takehiro Akama; Takao Nishizeki

• Book ID: 112079187
• Publisher: John Wiley and Sons
• Year: 1989
• Tongue: English
• Weight: 750 KB
• Volume: 72
• Category: Article
• ISSN: 1042-0967
• DOI: 10.1002/ecjc.4430721007