An $O(m\log n)$-Time Algorithm for the Maximal Planar Subgraph Problem

• Jiazhen Cai

• Xiaofeng Han

• Robert E. Tarjan

収録刊行物

• SIAM Journal on Computing

  SIAM Journal on Computing 22 (6), 1142-1162, 1993-12

  Society for Industrial & Applied Mathematics (SIAM)

キーワード

• General Mathematics
• General Computer Science

詳細情報

• CRID: 1363951795416528640
• NII論文ID: 30006807169
• DOI: 10.1137/0222068
• ISSN: 10957111
• ISSN: 00975397
• Web Site: http://epubs.siam.org/doi/pdf/10.1137/0222068
• データソース種別:
  • Crossref
  • CiNii Articles