scientific article; zbMATH DE number 4047154

MaRDI QIDQ3783600zbMATH OpenFDO

Authors Satoru Miyano

Publication date 1987

zbMATH Keywords

lexicographically first maximal subgraphNC algorithmsP-completeness

Mathematics Subject Classification ID

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

Recommendations

• The lexicographically first maximal subgraph problems:P-completeness andNC algorithms
• scientific article; zbMATH DE number 4060745
• \(\Delta{} ^ p_ 2\)-complete lexicographically first maximal subgraph problems
• On the complexity of the maximum subgraph problem
• scientific article; zbMATH DE number 17799

Cited in

(12)

• A parallelizable lexicographically first maximal edge-induced subgraph problem
• \(\Delta{} ^ p_ 2\)-complete lexicographically first maximal subgraph problems
• The complexity of circuit value and network stability
• Efficient parallel algorithms for parameterized problems
• scientific article; zbMATH DE number 4060745 (Why is no real title available?)
• scientific article; zbMATH DE number 17799 (Why is no real title available?)
• scientific article; zbMATH DE number 2044949 (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
• 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 Q3783600)