scientific article; zbMATH DE number 140477

MaRDI QIDQ4028895zbMATH OpenFDO

Authors Samir Khuller

Publication date 28 March 1993

zbMATH Keywords

parallel algorithmsparallel complexityNC algorithmssubgraph homeomorphism problemforbidden homeomorphsouter-planar

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 4049079
• An approach to the subgraph homeomorphism problem
• The subgraph homeomorphism problem
• An exact algorithm for subgraph homeomorphism
• scientific article; zbMATH DE number 4072379

Cited in

(8)

• scientific article; zbMATH DE number 4072379 (Why is no real title available?)
• Subgraph homeomorphism via the edge addition planarity algorithm
• An exact algorithm for subgraph homeomorphism
• scientific article; zbMATH DE number 4049079 (Why is no real title available?)
• Deciding whether graph \(G\) has page number one is in NC
• An approach to the subgraph homeomorphism problem
• The subgraph homeomorphism problem
• On Exact Complexity of Subgraph Homeomorphism

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4028895)