scientific article; zbMATH DE number 4060745

MaRDI QIDQ3795248zbMATH OpenFDO

Authors Satoru Miyano

Publication date 1988

zbMATH Keywords

\(\Delta^ p_ 2\)- completedirected acyclic graphslexicographically first maximal subgraph problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• \(\Delta{} ^ p_ 2\)-complete lexicographically first maximal subgraph problems
• scientific article; zbMATH DE number 1107742
• The lexicographically first maximal subgraph problems:P-completeness andNC algorithms
• scientific article; zbMATH DE number 4047154
• scientific article; zbMATH DE number 17799

Cited in

(11)

• \(\Delta{} ^ p_ 2\)-complete lexicographically first maximal subgraph problems
• scientific article; zbMATH DE number 4047154 (Why is no real title available?)
• scientific article; zbMATH DE number 17799 (Why is no real title available?)
• scientific article; zbMATH DE number 1107742 (Why is no real title available?)
• scientific article; zbMATH DE number 219246 (Why is no real title available?)
• The lexicographically first maximal subgraph problems:P-completeness andNC algorithms
• scientific article; zbMATH DE number 841624 (Why is no real title available?)
• A measure for the lexicographically first maximal independent set problem and its limits
• Ordered vertex removal and subgraph problems
• The lexicographically first topological order problem is NLOG-complete
• A P-complete graph partition problem

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 Q3795248)